In computational complexity theory, a complexity class is a set of problems of related resource-based complexity. A typical complexity class has aâ€¦Â (More)

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)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Eric Allender, Peter BÃ¼rgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
- 21st Annual IEEE Conference on Computationalâ€¦
- 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

- Jack H. Lutz
- IEEE Conference on Computational Complexity
- 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

- Neil Immerman
- Graduate Texts in Computer Science
- 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

- Alan L. Selman
- J. Comput. Syst. Sci.
- 1994

This paper comprises a systematic comparison of several complexity classes of functions that are computed nondeterministically inâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Jack H. Lutz
- Structure in Complexity Theory Conference
- 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

- Neil Immerman
- SIAM J. Comput.
- 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

- LÃ¡szlÃ³ Babai, Peter Frankl, Janos Simon
- 27th Annual Symposium on Foundations of Computerâ€¦
- 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

- Moshe Y. Vardi
- STOC
- 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

- Ashok K. Chandra, David Harel
- 21st Annual Symposium on Foundations of Computerâ€¦
- 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?