NP (complexity)

Known as: NP, NP (complexity class), Class NP 
In computational complexity theory, NP is a complexity class used to describe certain types of decision problems. Informally, NP is the set of all… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Data complexityof reasoning in description logics (DLs) estimates the performance of reasoning algorithms measured in the size of… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2002
Highly Cited
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
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)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
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
1994
Highly Cited
1994
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1991
Highly Cited
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)
  • figure 1
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
Recursive analysis, the theory of computation of functions on real numbers, has been studied from various aspects. We investigate… (More)
  • figure 1
Is this relevant?
Highly Cited
1981
Highly Cited
1981
This paper was motivated by a practical problem related to databases for image processing: given a set of points in the plane… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1977
Highly Cited
1977
The computational complexity of the provability problem in systems of modal proposi-tional logic is investigated. Every problem… (More)
  • figure 1
Is this relevant?