NP (complexity)
From Wikipedia, the free encyclopedia
In computational complexity theory, NP is one of the most fundamental complexity classes. The abbreviation NP refers to "Nondeterministic Polynomial time".
Intuitively, NP is the set of all decision problems for which the 'yes'answers have simple proofs of the fact that the answer is indeed 'yes'. More precisely, these proofs have to be verifiable in polynomial time by a deterministic Turing machine. In an equivalent formal definition, NP is the set of decision problems solvable in polynomial time by a nondeterministic Turing machine.
The complexity class P is contained in NP, but NP contains many important problems, the hardest of which are called NPcomplete problems, for which no polynomialtime algorithms are known. The most important open question in complexity theory, the P = NP problem, asks whether such algorithms actually exist for NPcomplete, and by corollary, all NP problems. It is widely believed that this is not the case.
Contents 
[edit] Formal definition
The complexity class NP can be defined in terms of NTIME as follows:
[edit] Introduction
Many natural computer science problems are covered by the class NP. In particular, the decision versions of many interesting search problems and optimization problems are contained in NP.
[edit] Verifierbased definition
In order to explain the verifierbased definition of NP, let us consider the subset sum problem: Assume that we are given some integers, such as {−7, −3, −2, 5, 8}, and we wish to know whether some of these integers sum up to zero. In this example, the answer is 'yes', since the subset of integers {3, 2, 5} corresponds to the sum (3) + (2) + 5 = 0. The task of deciding whether such a subset with sum zero exists is called the subset sum problem.
As the number of integers that we feed into the algorithm becomes larger, the number of subsets grows exponentially, and in fact the subset sum problem is NPcomplete. However, notice that, if we are given a particular subset (often called a certificate), we can easily check or verify whether the subset sum is zero, by just summing up the integers of the subset. So if the sum is indeed zero, that particular subset is the proof or witness for the fact that the answer is 'yes'. An algorithm that verifies whether a given subset has sum zero is called verifier. A problem is said to be in NP if and only if there exists a verifier for the problem that executes in polynomial time. In case of the subset sum problem, the verifier needs only polynomial time, for which reason the subset sum problem is in NP.
Note that the verifierbased definition of NP does not require an easytoverify certificate for the 'no'answers. The class of problems with such certificates for the 'no'answers is called coNP. In fact, it is an open question whether all problems in NP also have certificates for the 'no'answers and thus are in coNP.
[edit] Machinedefinition
Equivalent to the verifierbased definition is the following characterization: NP is the set of decision problems solvable in polynomial time by a nondeterministic Turing machine.
[edit] Examples
This is an incomplete list of problems that are in NP.
 All problems in P (For, given a certificate for a problem in P, we can ignore the certificate and just solve the problem in polynomial time. Alternatively, note that a deterministic Turing machine is also trivially a nondeterministic Turing machine that just happens to not use any nondeterminism.)
 The decision problem version of the integer factorization problem: given integer n and k, is there a factor f with 1 < f < k and f dividing n?
 The graph isomorphism problem of determining whether two graphs can be drawn identically
 All NPcomplete problems, e.g.:
 A variant of the traveling salesman problem, where we want to know if there is a route of some length that goes through all the nodes in a certain network
 The boolean satisfiability problem, where we want to know if a certain formula in propositional logic with boolean variables can be true for some value of the variables or not
[edit] Why some NP problems are hard to solve
Because of the many important problems in this class, there have been extensive efforts to find polynomialtime algorithms for problems in NP. However, there remain a large number of problems in NP that defy such attempts, seeming to require superpolynomial time. Whether these problems really aren't decidable in polynomial time is one of the greatest open questions in computer science (see P=NP problem for an indepth discussion).
An important notion in this context is the set of NPcomplete decision problems, which is a subset of NP and might be informally described as the "hardest" problems in NP. If there is a polynomialtime algorithm for even one of them, then there is a polynomialtime algorithm for all the problems in NP. Because of this, and because dedicated research has failed to find a polynomial algorithm for any NPcomplete problem, once a problem has been proven to be NPcomplete this is widely regarded as a sign that a polynomial algorithm for this problem is unlikely to exist.
[edit] Equivalency of definitions
The two definitions of NP as the class of problems solvable by a nondeterministic Turing machine (TM) in polynomial time and the class of problems verifiable by a deterministic Turing machine in polynomial time are equivalent. The proof is described by many textbooks, for example Sipser's Introduction to the Theory of Computation, section 7.3.
To show this, first suppose we have a deterministic verifier. A nondeterministic machine can simply nondeterministically run the verifier on all possible proof strings (this requires only polynomiallymany steps because it can nondeterministically choose the next character in the proof string in each step, and the length of the proof string must be polynomially bounded). If any proof is valid, some path will accept; if no proof is valid, the string is not in the language and it will reject.
Conversely, suppose we have a nondeterministic TM called A accepting a given language L. At each of its polynomiallymany steps, the machine's computation tree branches in at most a constant number of directions. There must be at least one accepting path, and the string describing this path is the proof supplied to the verifier. The verifier can then deterministically simulate A, following only the accepting path, and verifying that its accepts at the end. If A rejects the input, there is no accepting path, and the verifier will never accept.
[edit] Relationship to other classes
NP contains all problems in P, since one can verify any instance of the problem by simply ignoring the proof and solving it. NP is contained in PSPACE—to show this, it suffices to construct a PSPACE machine that loops over all proof strings and feeds each one to a polynomialtime verifier. Since a polynomialtime machine can only read polynomiallymany bits, it cannot use more than polynomial space, nor can it read a proof string occupying more than polynomial space (so we don't have to consider proofs longer than this). NP is also contained in EXPTIME, since the same algorithm operates in exponential time.
The complement of NP, coNP, contains those problems which have a simple proof for no instances, sometimes called counterexamples. For example, primality testing trivially lies in coNP, since one can refute the primality of an integer by merely supplying a nontrivial factor. NP and coNP together form the first level in the polynomial hierarchy, higher only than P.
NP is defined using only deterministic machines. If we permit the verifier to be probabilistic (specifically, a BPP machine), we get the class MA solvable using a ArthurMerlin protocol with no communication from Merlin to Arthur.
NP is a class of decision problems; the analogous class of function problems is FNP.
[edit] Other characterizations
There is also a simple logical characterization of NP: it contains precisely those languages expressible in secondorder logic restricted to exclude universal quantification over relations, functions, and subsets.
NP can be seen as a very simple type of interactive proof system, where the prover comes up with the proof certificate and the verifier is a deterministic polynomialtime machine that checks it. It is complete because the right proof string will make it accept if there is one, and it is sound because the verifier cannot accept if there is no acceptable proof string.
A major result of complexity theory is that NP can be characterized as the problems solvable by probabilistically checkable proofs where the verifier uses O(log n) random bits and examines only a constant number of bits of the proof string (the class PCP(log n, 1)). More informally, this means that the NP verifier described above can be replaced with one that just "spotchecks" a few places in the proof string, and using a limited number of coin flips can determine the correct answer with high probability. This allows several results about the hardness of approximation algorithms to be proven.
[edit] Example
The decision version of the traveling salesman problem is in NP. Given an input matrix of distances between N cities, the problem is to determine if there is a route visiting all cities with total distance less than k. A nondeterministic Turing machine can find such a route as follows:
 At each city it visits it "guesses" the next city to visit, until it has visited every vertex. If it gets stuck, it stops immediately.
 At the end it verifies that the route it has taken has cost less than k in O(n) time.
One can think of each guess as "forking" a new copy of the Turing machine to follow each of the possible paths forward, and if at least one machine finds a route of distance less than k, that machine accepts the input. (Equivalently, this can be thought of as a single Turing machine that always guesses correctly)
Binary search on the range of possible distances can convert the decision version of Traveling Salesman to the optimization version, by calling the decision version repeatedly (a polynomial number of times).
[edit] References
 Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGrawHill, 2001. ISBN 0262032937. Section 34.2: Polynomialtime verification, pp.979–983.
 Michael Sipser (1997). Introduction to the Theory of Computation. PWS Publishing. ISBN 053494728X. Sections 7.3–7.5 (The Class NP, NPcompleteness, Additional NPcomplete Problems), pp.241–271.
 David Harel, Yishai Feldman. Algorithmics: The Spirit of Computing, AddisonWesley, Reading, MA, 3rd edition, 2004.
[edit] External links
 American Scientist primer on traditional and recent complexity theory research: "Accidental Algorithms"
