Skip to main content
Conference ProceedingsOPEN ACCESS

The parametric ordinal-recursive complexity of post embedding problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7794 LNCS 273-288
DOI: 10.1007/978-3-642-37075-5_18
8Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Karandikar, P., & Schmitz, S. (2013). The parametric ordinal-recursive complexity of post embedding problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7794 LNCS, pp. 273–288). https://doi.org/10.1007/978-3-642-37075-5_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free