The Parametric Complexity of Lossy Counter Machines - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

The Parametric Complexity of Lossy Counter Machines

Résumé

The reachability problem in lossy counter machines is the best-known ACKERMANN-complete problem and has been used to establish most of the ACKERMANN-hardness statements in the literature. This hides however a complexity gap when the number of counters is fixed. We close this gap and prove Fd-completeness for machines with d counters, which provides the first known uncontrived problems complete for the fast-growing complexity classes at levels 3 < d < ω. We develop for this an approach through antichain factorisations of bad sequences and analysing the length of controlled antichains.
Fichier principal
Vignette du fichier
main.pdf (617.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02020728 , version 1 (15-02-2019)
hal-02020728 , version 2 (21-04-2019)

Licence

Paternité - Partage selon les Conditions Initiales

Identifiants

  • HAL Id : hal-02020728 , version 1

Citer

Sylvain Schmitz. The Parametric Complexity of Lossy Counter Machines. 2019. ⟨hal-02020728v1⟩
198 Consultations
255 Téléchargements

Partager

Gmail Facebook X LinkedIn More