Complexity Hierarchies Beyond Elementary
Computational Complexity
2016-02-05 v3 Logic in Computer Science
Abstract
We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary complexity, which occur naturally in logic, combinatorics, formal languages, verification, etc., with complexities ranging from simple towers of exponentials to Ackermannian and beyond.
Cite
@article{arxiv.1312.5686,
title = {Complexity Hierarchies Beyond Elementary},
author = {Sylvain Schmitz},
journal= {arXiv preprint arXiv:1312.5686},
year = {2016}
}
Comments
Version 3 is the published version in TOCT 8(1:3), 2016. I will keep updating the catalogue of problems from Section 6 in future revisions