Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Is this relevant?

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

Is this relevant?

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

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

Is this relevant?

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

Is this relevant?

Highly Cited

1990

Highly Cited

1990

Publisher Summary This chapter discusses the concepts needed for defining the complexity classes. A complexity class is a set of… Expand

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

Is this relevant?

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

Is this relevant?

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

Is this relevant?

Highly Cited

1970

Highly Cited

1970

The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a deterministic Turing machine is… Expand

Is this relevant?