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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2018
05010019682018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
We resolve the question of the complexity of Nash equilibrium by showing that the problem of computing a Nash equilibrium in a… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A theory of resource-bounded dimension is developed using gales, which are natural generalizations of martingales. When the… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This paper comprises a systematic comparison of several complexity classes of functions that are computed nondeterministically in… (More)
  • figure 1
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We investigate the distribution of nonuniform complexities in uniform complexity classes We prove that almost every problem… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We present in this paper a series of languages adequate for expressing exactly those properties checkable in a series of… (More)
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Two complexity measures for query languages are proposed. <italic>Data complexity</italic> is the complexity of evaluating a… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
This paper is an attempt at laying the foundations for the classification of queries on relational data bases according to their… (More)
Is this relevant?