The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
Logic in Computer Science
2013-08-23 v1
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.
Cite
@article{arxiv.1211.5259,
title = {The Parametric Ordinal-Recursive Complexity of Post Embedding Problems},
author = {Prateek Karandikar and Sylvain Schmitz},
journal= {arXiv preprint arXiv:1211.5259},
year = {2013}
}
Comments
16 + vii pages