Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,887,557 papers from all fields of science
Search
Sign In
Create Free Account
Complexity class
Known as:
Computational complexity classes
, Time-complexity class
, Complexity classes
Expand
In computational complexity theory, a complexity class is a set of problems of related resource-based complexity. A typical complexity class has a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AC (complexity)
AC0
AWPP (complexity)
Abstract machine
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Impossibility of Classically Simulating One-Clean-Qubit Computation
Keisuke Fujii
,
Hirotada Kobayashi
,
T. Morimae
,
H. Nishimura
,
S. Tamate
,
S. Tani
arXiv.org
2014
Corpus ID: 263442730
2012
2012
An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Division
A. Porreca
,
Niall Murphy
,
M. J. P. Jiménez
2012
Corpus ID: 17432122
Summary. In the framework of tissue P systems with cell division, the length of communication rules provides a frontier for the…
Expand
2012
2012
Size complexity of rotating and sweeping automata
Christos A. Kapoutsis
,
Richard Královic
,
Tobias Mömke
Journal of computer and system sciences (Print)
2012
Corpus ID: 20700026
2010
2010
Experimental assessment of combining pattern matching strategies with VIATRA2
Á. Horváth
,
Gábor Bergmann
,
I. Ráth
,
Dániel Varró
International Journal on Software Tools for…
2010
Corpus ID: 14018894
As recent tool contests demonstrated graph transformation tools scale up to handle very large models for model transformations…
Expand
Highly Cited
2007
Highly Cited
2007
Class-Specific Kernel-Discriminant Analysis for Face Verification
Georgios Goudelis
,
S. Zafeiriou
,
A. Tefas
,
I. Pitas
IEEE Transactions on Information Forensics and…
2007
Corpus ID: 12617809
In this paper, novel nonlinear subspace methods for face verification are proposed. The problem of face verification is…
Expand
2004
2004
On the reducibility of sets inside NP to sets with low information content
Mitsunori Ogihara
,
Till Tantau
Journal of computer and system sciences (Print)
2004
Corpus ID: 11030898
Highly Cited
2003
Highly Cited
2003
The chaos of software development
A. Hassan
,
R. Holt
Sixth International Workshop on Principles of…
2003
Corpus ID: 18863043
We present a new perspective on the problem of complexity in software, using sound mathematical concepts from information theory…
Expand
1995
1995
Using autoreducibility to separate complexity classes
H. Buhrman
,
L. Fortnow
,
L. Torenvliet
Proceedings of IEEE 36th Annual Foundations of…
1995
Corpus ID: 16235476
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…
Expand
1994
1994
On the node complexity of neural networks
B. Horne
,
D. Hush
Neural Networks
1994
Corpus ID: 931652
1991
1991
On Oblivious Branching Programs of Linear Length
S. Waack
,
Matthias Krause
Information and Computation
1991
Corpus ID: 39394976
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)
ACCEPT & CONTINUE
or Only Accept Required