Complexity Hierarchies beyond Elementary

@article{Schmitz2016ComplexityHB,
  title={Complexity Hierarchies beyond Elementary},
  author={S. Schmitz},
  journal={ArXiv},
  year={2016},
  volume={abs/1312.5686}
}
  • S. Schmitz
  • Published 2016
  • Mathematics, Computer Science
  • ArXiv
We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many nonelementary problems. This hierarchy allows the classification of many decision problems with a nonelementary complexity, which occur naturally in areas such as logic, combinatorics, formal languages, and verification, with complexities ranging from simple towers of exponentials to Ackermannian and beyond. 
Non-elementary complexities for branching VASS, MELL, and extensions
Complexity Bounds for Ordinal-Based Termination - (Invited Talk)
Complexity of controlled bad sequences over finite sets of Nd
On Functions Weakly Computable by Petri Nets and Vector Addition Systems
Algorithmic Complexity of Well-Quasi-Orders
Equivalence of pushdown automata via first-order grammars
  • P. Jancar
  • Computer Science
  • J. Comput. Syst. Sci.
  • 2021
Polynomial automata: Zeroness and applications
Non Primitive Recursive Complexity Classes
...
1
2
3
4
5
...

References

SHOWING 1-7 OF 7 REFERENCES
Graph Logics with Rational Relations and the Generalized Intersection Problem
Hierarchies of provably recursive functions
  • Handbook of Proof Theory, volume 137 of Studies in Logic and the Foundations of Mathematics, chapter III, pages 149–207. Elsevier,
  • 1998
Proofs and Computation
  • Proofs and Computation
  • 2012
Proofs and Computation. Perspectives in Logic
  • Proofs and Computation. Perspectives in Logic
  • 2012
Well-structured transition systems everywhere! Theor
  • Comput. Sci
  • 2001
Algorithmic aspects of WQO theory. Lecture notes, 2012. URL http://cel.archives-ouvertes
  • Algorithmic aspects of WQO theory. Lecture notes, 2012. URL http://cel.archives-ouvertes