Skip to search formSkip to main contentSkip to account menu

Complexity class

Known as: Computational complexity classes, Time-complexity class, Complexity classes 
In computational complexity theory, a complexity class is a set of problems of related resource-based complexity. A typical complexity class has a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AC (complexity)AC0AWPP (complexity)Abstract machine

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Impossibility of Classically Simulating One-Clean-Qubit Computation
2012
2012
An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Division
Summary. In the framework of tissue P systems with cell division, the length of communication rules provides a frontier for the… 
2012
2012
Size complexity of rotating and sweeping automata
2010
2010
Experimental assessment of combining pattern matching strategies with VIATRA2
As recent tool contests demonstrated graph transformation tools scale up to handle very large models for model transformations… 
2004
2004
On the reducibility of sets inside NP to sets with low information content
1996
1996
Intrinsically Hyperarithmetical Sets
The main result proved in the paper is that on every recursive structure the intrinsically hyperarithmetical sets coincide with… 
1995
1995
Using autoreducibility to separate complexity classes
A language is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We… 
1994
1994
On the node complexity of neural networks
1991
1991
On Oblivious Branching Programs of Linear Length
1990
1990
Bi-Immunity Results for Cheatable Sets
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)