The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
Prateek Karandikar, Sylvain Schmitz
TL;DR
This paper investigates the complexity of Post Embedding Problems, refining previous constructions to establish parametric lower bounds based on alphabet size, highlighting their non-multiply-recursive nature.
Contribution
It provides a refined construction for Post Embedding Problems that yields parametric lower bounds depending on alphabet size, advancing understanding of their complexity.
Findings
Proves non-multiply-recursive lower bounds for Post Embedding Problems
Refines Chambart and Schnoebelen's construction for better bounds
Establishes parametric complexity depending on alphabet size
Abstract
Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) and prove parametric lower bounds depending on the size of the alphabet.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.