Work

Complexity Hierarchies beyond Elementary

Year: 2016

Type: article

Abstract: 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.

Source: ACM Transactions on Computation Theory

DOI: 10.1145/2858784

Author: Sylvain Schmitz

Institutions: École Normale Supérieure Paris-Saclay, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Université Paris-Saclay

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Agence Nationale de la Recherche

Award: Taming Hard Reachability Problems for Counter Systems