The Parametric Ordinal-Recursive Complexity of Post Embedding Problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

The Parametric Ordinal-Recursive Complexity of Post Embedding Problems

Résumé

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.

Dates et versions

hal-00793808 , version 1 (23-02-2013)

Identifiants

Citer

Prateek Karandikar, Sylvain Schmitz. The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. 16th International Conference on Foundations of Software Science and Computation Structures, Mar 2013, Rome, Italy. pp.273--288, ⟨10.1007/978-3-642-37075-5_18⟩. ⟨hal-00793808⟩
46 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More