Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 207,842,410 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2009

Highly Cited

2009

We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD…

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…

Highly Cited

2004

Highly Cited

2004

The k-LOCAL HAMILTONIAN problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is…

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…

Highly Cited

1997

Highly Cited

1997

Traditionally, computational complexity has considered only static problems. Classical complexity classes such as NC, P, and NP…

Highly Cited

1990

Highly Cited

1990

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…

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…

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…

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…