Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Data complexity of reasoning in description logics (DLs) estimates the performance of reasoning algorithms measured in the size… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
  • I. Niemelä
  • Annals of Mathematics and Artificial Intelligence
  • 2004
  • Corpus ID: 14465318
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of… Expand
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… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Computational complexity is the study of the difficulty of solving computational problems, in terms of the required computational… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are classes of optimization problems, and in… Expand
  • figure 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
It is well known that for many NP-complete problems, such as K-Sat, etc., typical cases are easy to solve; so that… Expand
  • figure 3
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations module… Expand
  • table 1
  • table 2
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
1978
Highly Cited
1978
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand
Is this relevant?