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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Summary. In the framework of tissue P systems with cell division, the length of communication rules provides a frontier for the… 
2012
2012
2010
2010
As recent tool contests demonstrated graph transformation tools scale up to handle very large models for model transformations… 
Highly Cited
2007
Highly Cited
2007
In this paper, novel nonlinear subspace methods for face verification are proposed. The problem of face verification is… 
2004
2004
Highly Cited
2003
Highly Cited
2003
  • A. HassanR. Holt
  • 2003
  • Corpus ID: 18863043
We present a new perspective on the problem of complexity in software, using sound mathematical concepts from information theory… 
1995
1995
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…