# NP (complexity)

## Papers overview

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

Highly Cited

2002

Highly Cited

2002

- STOC
- 2002

A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edgeâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- STOC
- 2002

(MATH) In this paper we investigate the following question: If $\np$ is slightly hard on average, is it very hard on average? Weâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- STOC
- 2000

For every e > 0 and integers k and q (with k < q <_ k+k2/4), we present a P C P character iza t ion of NP, where the verifierâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- STOC
- 1997

We introduce a new low-degree-test, one that uses the restriction of low-degree polynomials to planes (i. e., afine sub-spaces ofâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Inf. Comput.
- 1995

It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existentialâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- J. Comput. Syst. Sci.
- 1991

W e define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are classes of optimization problems, andâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- 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

- Theor. Comput. Sci.
- 1982

Recursive analysis, the theory of computation of functions on real numbers, has been studied from various aspects. We investigateâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Inf. Process. Lett.
- 1981

This paper was motivated by a practical problem related to databases for image processing: given a set of points in the planeâ€¦Â (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- SIAM J. Comput.
- 1977

The computational complexity of the provability problem in systems of modal proposi-tional logic is investigated. Every problemâ€¦Â (More)

Is this relevant?