The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Complexity Hierarchies Beyond Elementary
The work
| Authors | Sylvain Schmitz |
|---|---|
| Editors | |
| Type | preprint |
| Year | 2013 |
| Citekey | schmitz2013complexity |
Identifiers
| arXiv | 1312.5686 from its doi |
|---|---|
| DOI | 10.48550/arxiv.1312.5686 |
Access
| Landing page | https://arxiv.org/abs/1312.5686 |
|---|---|
| Free full text | https://arxiv.org/pdf/1312.5686 |
From arxiv.
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.
How it got here
| How it got here | agent via arxiv |
|---|---|
| Added | 2026-10-24 17:56 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@unpublished{schmitz2013complexity,
title = {Complexity Hierarchies Beyond Elementary},
author = {Sylvain Schmitz},
year = {2013},
doi = {10.48550/arxiv.1312.5686},
}
This record lives at https://refs.drheap.org/schmitz2013complexity/ and will keep doing so.