Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
In 1951, John F. Nash proved that every game has a Nash equilibrium [Ann. of Math. (2), 54 (1951), pp. 286-295]. His proof is… Expand
Highly Cited
2006
Highly Cited
2006
We resolve the question of the complexity of Nash equilibrium by showing that the problem of computing a Nash equilibrium in a… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Highly Cited
1999
Highly Cited
1999
  • N. Immerman
  • Graduate Texts in Computer Science
  • 1999
  • Corpus ID: 6916124
Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The… Expand
  • figure 1.1
  • figure 1.11
  • table 1.19
  • figure 2.13
  • figure 2.21
Highly Cited
1995
Highly Cited
1995
Abstract It is nowadays generally agreed that a person's information seeking depends on his or her tasks and the problems… Expand
Highly Cited
1990
Highly Cited
1990
  • D. Johnson
  • Handbook of Theoretical Computer Science, Volume…
  • 1990
  • Corpus ID: 6026780
Publisher Summary This chapter discusses the concepts needed for defining the complexity classes. A complexity class is a set of… Expand
Highly Cited
1987
Highly Cited
1987
We present a series of operators of apparently increasing power which when added to first-order logic produce a series of… Expand
Highly Cited
1986
Highly Cited
1986
We take a complexity theoretic view of A. C. Yao's theory of communication complexity. A rich structure of natural complexity… Expand
Highly Cited
1982
Highly Cited
1982
Two complexity measures for query languages are proposed. Data complexity is the complexity of evaluating a query in the language… Expand
Highly Cited
1980
Highly Cited
1980
It is well known that every set in P has small circuits [13]. Adleman [1] has recently proved the stronger result that every set… Expand
Highly Cited
1970
Highly Cited
1970
  • W. Savitch
  • J. Comput. Syst. Sci.
  • 1970
  • Corpus ID: 19435968
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a deterministic Turing machine is… Expand