Add to ORKGAbstract. We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non ele-mentary problems. This hierarchy allows the classification of many deci-sion problems with a non-elementary complexity, which occur naturally in logic, combinatorics, formal languages, verification, etc., with com-plexities ranging from simple towers of exponentials to Ackermannian and beyond. 1
AbstractA low and a high hierarchy within NP are defined. The definition is similar to the jump hier...
168 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.We focus on the A° sets and s...
During the last few years, unprecedented programs has been made in structural complexity theory; cla...
International audienceWe introduce a hierarchy of fast-growing complexity classes and show its suita...
We present an a.e. complexity hierarchy for nondeterministic time, and show that it is essentially t...
We introduce two hierarchies of unknown ordinal height. The hierarchies are induced by natural fragm...
We investigate an imperative and a functional programming language. The computational power of fragm...
AbstractWe show how Abstract Complexity Theory is related to the degrees of unsolvability and develo...
AbstractIn Descriptive Complexity, we investigate the use of logics to characterize computational co...
AbstractWe present an almost-everywhere complexity hierarchy for nondeterministic time, and show tha...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
A new syntactic characterization of problems complete via Turing re-ductions is presented. General c...
In this thesis, we present some results in computational complexity. We consider two approaches for ...
International audienceComplexity theory provides a wealth of complexity classes for analyzing the co...
Following the approach of Hemaspaandra and Vollmer, we can define counting complexity classes #·C fo...
AbstractA low and a high hierarchy within NP are defined. The definition is similar to the jump hier...
168 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.We focus on the A° sets and s...
During the last few years, unprecedented programs has been made in structural complexity theory; cla...
International audienceWe introduce a hierarchy of fast-growing complexity classes and show its suita...
We present an a.e. complexity hierarchy for nondeterministic time, and show that it is essentially t...
We introduce two hierarchies of unknown ordinal height. The hierarchies are induced by natural fragm...
We investigate an imperative and a functional programming language. The computational power of fragm...
AbstractWe show how Abstract Complexity Theory is related to the degrees of unsolvability and develo...
AbstractIn Descriptive Complexity, we investigate the use of logics to characterize computational co...
AbstractWe present an almost-everywhere complexity hierarchy for nondeterministic time, and show tha...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
A new syntactic characterization of problems complete via Turing re-ductions is presented. General c...
In this thesis, we present some results in computational complexity. We consider two approaches for ...
International audienceComplexity theory provides a wealth of complexity classes for analyzing the co...
Following the approach of Hemaspaandra and Vollmer, we can define counting complexity classes #·C fo...
AbstractA low and a high hierarchy within NP are defined. The definition is similar to the jump hier...
168 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.We focus on the A° sets and s...
During the last few years, unprecedented programs has been made in structural complexity theory; cla...