Unsolved problem in computer science: If the solution to a problem is easy to check for correctness, must the problem be easy to solve? (more unsolved problems in computer science)

The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified (technically, verified in polynomial time) can also be solved quickly (again, in polynomial time).
The underlying issues were first discussed in the 1950s, in letters from John Forbes Nash Jr. to the National Security Agency, and from Kurt Gödel to John von Neumann. The precise statement of the P versus NP problem was introduced in 1971 by Stephen Cook in his seminal paper "The complexity of theorem proving procedures"^{[2]} (and independently by Leonid Levin in 1973^{[3]}) and is considered by many to be the most important open problem in computer science.^{[4]} It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute, each of which carries a US$1,000,000 prize for the first correct solution.
The informal term quickly, used above, means the existence of an algorithm solving the task that runs in polynomial time, such that the time to complete the task varies as a polynomial function on the size of the input to the algorithm (as opposed to, say, exponential time). The general class of questions for which some algorithm can provide an answer in polynomial time is called "class P" or just "P". For some questions, there is no known way to find an answer quickly, but if one is provided with information showing what the answer is, it is possible to verify the answer quickly. The class of questions for which an answer can be verified in polynomial time is called NP, which stands for "nondeterministic polynomial time".^{[Note 1]}
Consider Sudoku, a game where the player is given a partially filledin grid of numbers and attempts to complete the grid following certain rules. Given an incomplete Sudoku grid, of any size, is there at least one legal solution? Any proposed solution is easily verified, and the time to check a solution grows slowly (polynomially) as the grid gets bigger. However, all known algorithms for finding solutions take, for difficult examples, time that grows exponentially as the grid gets bigger. So, Sudoku is in NP (quickly checkable) but does not seem to be in P (quickly solvable). Thousands of other problems seem similar, in that they are fast to check but slow to solve. Researchers have shown that many of the problems in NP have the extra property that a fast solution to any one of them could be used to build a quick solution to any other problem in NP, a property called NPcompleteness. Decades of searching have not yielded a fast solution to any of these problems, so most scientists suspect that none of these problems can be solved quickly. This, however, has never been proven.
An answer to the P = NP question would determine whether problems that can be verified in polynomial time, like Sudoku, can also be solved in polynomial time. If it turned out that P ? NP, it would mean that there are problems in NP that are harder to compute than to verify: they could not be solved in polynomial time, but the answer could be verified in polynomial time.
Aside from being an important problem in computational theory, a proof either way would have profound implications for mathematics, cryptography, algorithm research, artificial intelligence, game theory, multimedia processing, philosophy, economics and many other fields.^{[5]}
Although the P versus NP problem was formally defined in 1971, there were previous inklings of the problems involved, the difficulty of proof, and the potential consequences. In 1955, mathematician John Nash wrote a letter to the NSA, where he speculated that cracking a sufficiently complex code would require time exponential in the length of the key.^{[6]} If proved (and Nash was suitably skeptical) this would imply what is now called P ? NP, since a proposed key can easily be verified in polynomial time. Another mention of the underlying problem occurred in a 1956 letter written by Kurt Gödel to John von Neumann. Gödel asked whether theoremproving (now known to be coNPcomplete) could be solved in quadratic or linear time,^{[7]} and pointed out one of the most important consequencesthat if so, then the discovery of mathematical proofs could be automated.
The relation between the complexity classes P and NP is studied in computational complexity theory, the part of the theory of computation dealing with the resources required during computation to solve a given problem. The most common resources are time (how many steps it takes to solve a problem) and space (how much memory it takes to solve a problem).
In such analysis, a model of the computer for which time must be analyzed is required. Typically such models assume that the computer is deterministic (given the computer's present state and any inputs, there is only one possible action that the computer might take) and sequential (it performs actions one after the other).
In this theory, the class P consists of all those decision problems (defined below) that can be solved on a deterministic sequential machine in an amount of time that is polynomial in the size of the input; the class NP consists of all those decision problems whose positive solutions can be verified in polynomial time given the right information, or equivalently, whose solution can be found in polynomial time on a nondeterministic machine.^{[8]} Clearly, P ? NP. Arguably the biggest open question in theoretical computer science concerns the relationship between those two classes:
In a 2002 poll of 100 researchers, 61 believed the answer to be no, 9 believed the answer is yes, and 22 were unsure; 8 believed the question may be independent of the currently accepted axioms and therefore impossible to prove or disprove.^{[9]}
In 2012, 10 years later, the same poll was repeated. The number of researchers who answered was 151: 126 (83%) believed the answer to be no, 12 (9%) believed the answer is yes, 5 (3%) believed the question may be independent of the currently accepted axioms and therefore impossible to prove or disprove, 8 (5%) said either don't know or don't care or don't want the answer to be yes nor the problem to be resolved.^{[10]}
To attack the P = NP question, the concept of NPcompleteness is very useful. NPcomplete problems are a set of problems to each of which any other NPproblem can be reduced in polynomial time, and whose solution may still be verified in polynomial time. That is, any NP problem can be transformed into any of the NPcomplete problems. Informally, an NPcomplete problem is an NP problem that is at least as "tough" as any other problem in NP.
NPhard problems are those at least as hard as NP problems, i.e., all NP problems can be reduced (in polynomial time) to them. NPhard problems need not be in NP, i.e., they need not have solutions verifiable in polynomial time.
For instance, the Boolean satisfiability problem is NPcomplete by the CookLevin theorem, so any instance of any problem in NP can be transformed mechanically into an instance of the Boolean satisfiability problem in polynomial time. The Boolean satisfiability problem is one of many such NPcomplete problems. If any NPcomplete problem is in P, then it would follow that P = NP. However, many important problems have been shown to be NPcomplete, and no fast algorithm for any of them is known.
Based on the definition alone it is not obvious that NPcomplete problems exist; however, a trivial and contrived NPcomplete problem can be formulated as follows: given a description of a Turing machine M guaranteed to halt in polynomial time, does there exist a polynomialsize input that M will accept?^{[11]} It is in NP because (given an input) it is simple to check whether M accepts the input by simulating M; it is NPcomplete because the verifier for any particular instance of a problem in NP can be encoded as a polynomialtime machine M that takes the solution to be verified as input. Then the question of whether the instance is a yes or no instance is determined by whether a valid input exists.
The first natural problem proven to be NPcomplete was the Boolean satisfiability problem, also known as SAT. As noted above, this is the CookLevin theorem; its proof that satisfiability is NPcomplete contains technical details about Turing machines as they relate to the definition of NP. However, after this problem was proved to be NPcomplete, proof by reduction provided a simpler way to show that many other problems are also NPcomplete, including the game Sudoku discussed earlier. In this case, the proof shows that a solution of Sudoku in polynomial time could also be used to complete Latin squares in polynomial time.^{[12]} This in turn gives a solution to the problem of partitioning tripartite graphs into triangles,^{[13]} which could then be used to find solutions for the special case of SAT known as 3SAT,^{[14]} which then provides a solution for general Boolean satisfiability. So a polynomial time solution to Sudoku leads, by a series of mechanical transformations, to a polynomial time solution of satisfiability, which in turn can be used to solve any other NPcomplete problem in polynomial time. Using transformations like this, a vast class of seemingly unrelated problems are all reducible to one another, and are in a sense "the same problem".
Although it is unknown whether P = NP, problems outside of P are known. Just as the class P is defined in terms of polynomial running time, the class EXPTIME is the set of all decision problems that have exponential running time. In other words, any problem in EXPTIME is solvable by a deterministic Turing machine in O(2^{p(n)}) time, where p(n) is a polynomial function of n. A decision problem is EXPTIMEcomplete if it is in EXPTIME, and every problem in EXPTIME has a polynomialtime manyone reduction to it. A number of problems are known to be EXPTIMEcomplete. Because it can be shown that P ? EXPTIME, these problems are outside P, and so require more than polynomial time. In fact, by the time hierarchy theorem, they cannot be solved in significantly less than exponential time. Examples include finding a perfect strategy for chess positions on an N × N board^{[15]} and similar problems for other board games.^{[16]}
The problem of deciding the truth of a statement in Presburger arithmetic requires even more time. Fischer and Rabin proved in 1974^{[17]} that every algorithm that decides the truth of Presburger statements of length n has a runtime of at least for some constant c. Hence, the problem is known to need more than exponential run time. Even more difficult are the undecidable problems, such as the halting problem. They cannot be completely solved by any algorithm, in the sense that for any particular algorithm there is at least one input for which that algorithm will not produce the right answer; it will either produce the wrong answer, finish without giving a conclusive answer, or otherwise run forever without producing any answer at all.
It is also possible to consider questions other than decision problems. One such class, consisting of counting problems, is called #P: whereas an NP problem asks "Are there any solutions?", the corresponding #P problem asks "How many solutions are there?" Clearly, a #P problem must be at least as hard as the corresponding NP problem, since a count of solutions immediately tells if at least one solution exists, if the count is greater than zero. Surprisingly, some #P problems that are believed to be difficult correspond to easy (for example lineartime) P problems.^{[18]} For these problems, it is very easy to tell whether solutions exist, but thought to be very hard to tell how many. Many of these problems are #Pcomplete, and hence among the hardest problems in #P, since a polynomial time solution to any of them would allow a polynomial time solution to all other #P problems.
It was shown by Ladner that if P ? NP then there exist problems in NP that are neither in P nor NPcomplete.^{[1]} Such problems are called NPintermediate problems. The graph isomorphism problem, the discrete logarithm problem and the integer factorization problem are examples of problems believed to be NPintermediate. They are some of the very few NP problems not known to be in P or to be NPcomplete.
The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic. An important unsolved problem in complexity theory is whether the graph isomorphism problem is in P, NPcomplete, or NPintermediate. The answer is not known, but it is believed that the problem is at least not NPcomplete.^{[19]} If graph isomorphism is NPcomplete, the polynomial time hierarchy collapses to its second level.^{[20]}^{[21]} Since it is widely believed that the polynomial hierarchy does not collapse to any finite level, it is believed that graph isomorphism is not NPcomplete. The best algorithm for this problem, due to László Babai and Eugene Luks, has run time 2^{O} for graphs with n vertices.
The integer factorization problem is the computational problem of determining the prime factorization of a given integer. Phrased as a decision problem, it is the problem of deciding whether the input has a factor less than k. No efficient integer factorization algorithm is known, and this fact forms the basis of several modern cryptographic systems, such as the RSA algorithm. The integer factorization problem is in NP and in coNP (and even in UP and coUP^{[22]}). If the problem is NPcomplete, the polynomial time hierarchy will collapse to its first level (i.e., NP = coNP). The best known algorithm for integer factorization is the general number field sieve, which takes expected time
to factor an nbit integer. However, the best known quantum algorithm for this problem, Shor's algorithm, does run in polynomial time, although this does not indicate where the problem lies with respect to nonquantum complexity classes.
All of the above discussion has assumed that P means "easy" and "not in P" means "hard", an assumption known as Cobham's thesis. It is a common and reasonably accurate assumption in complexity theory; however, it has some caveats.
First, it is not always true in practice. A theoretical polynomial algorithm may have extremely large constant factors or exponents thus rendering it impractical. On the other hand, even if a problem is shown to be NPcomplete, and even if P ? NP, there may still be effective approaches to tackling the problem in practice. There are algorithms for many NPcomplete problems, such as the knapsack problem, the traveling salesman problem and the Boolean satisfiability problem, that can solve to optimality many realworld instances in reasonable time. The empirical averagecase complexity (time vs. problem size) of such algorithms can be surprisingly low. An example is the simplex algorithm in linear programming, which works surprisingly well in practice; despite having exponential worstcase time complexity it runs on par with the best known polynomialtime algorithms.^{[24]}
Second, there are types of computations which do not conform to the Turing machine model on which P and NP are defined, such as quantum computation and randomized algorithms.
According to polls,^{[9]}^{[25]} most computer scientists believe that P ? NP. A key reason for this belief is that after decades of studying these problems no one has been able to find a polynomialtime algorithm for any of more than 3000 important known NPcomplete problems (see List of NPcomplete problems). These algorithms were sought long before the concept of NPcompleteness was even defined (Karp's 21 NPcomplete problems, among the first found, were all wellknown existing problems at the time they were shown to be NPcomplete). Furthermore, the result P = NP would imply many other startling results that are currently believed to be false, such as NP = coNP and P = PH.
It is also intuitively argued that the existence of problems that are hard to solve but for which the solutions are easy to verify matches realworld experience.^{[26]}
If P = NP, then the world would be a profoundly different place than we usually assume it to be. There would be no special value in "creative leaps," no fundamental gap between solving a problem and recognizing the solution once it's found.
 Scott Aaronson, then at MIT
On the other hand, some researchers believe that there is overconfidence in believing P ? NP and that researchers should explore proofs of P = NP as well. For example, in 2002 these statements were made:^{[9]}
The main argument in favor of P ? NP is the total lack of fundamental progress in the area of exhaustive search. This is, in my opinion, a very weak argument. The space of algorithms is very large and we are only at the beginning of its exploration. [...] The resolution of Fermat's Last Theorem also shows that very simple questions may be settled only by very deep theories.
Being attached to a speculation is not a good guide to research planning. One should always try both directions of every problem. Prejudice has caused famous mathematicians to fail to solve famous problems whose solution was opposite to their expectations, even though they had developed all the methods required.
One of the reasons the problem attracts so much attention is the consequences of the answer. Either direction of resolution would advance theory enormously, and perhaps have huge practical consequences as well.
A proof that P = NP could have stunning practical consequences if the proof leads to efficient methods for solving some of the important problems in NP. It is also possible that a proof would not lead directly to efficient methods, perhaps if the proof is nonconstructive, or the size of the bounding polynomial is too big to be efficient in practice. The consequences, both positive and negative, arise since various NPcomplete problems are fundamental in many fields.
Cryptography, for example, relies on certain problems being difficult. A constructive and efficient solution^{[Note 2]} to an NPcomplete problem such as 3SAT would break most existing cryptosystems including:
These would need to be modified or replaced by informationtheoretically secure solutions not inherently based on PNP equivalence.
On the other hand, there are enormous positive consequences that would follow from rendering tractable many currently mathematically intractable problems. For instance, many problems in operations research are NPcomplete, such as some types of integer programming and the travelling salesman problem. Efficient solutions to these problems would have enormous implications for logistics. Many other important problems, such as some problems in protein structure prediction, are also NPcomplete;^{[30]} if these problems were efficiently solvable it could spur considerable advances in life sciences and biotechnology.
But such changes may pale in significance compared to the revolution an efficient method for solving NPcomplete problems would cause in mathematics itself. Gödel, in his early thoughts on computational complexity, noted that a mechanical method that could solve any problem would revolutionize mathematics:^{[31]}^{[32]}
If there really were a machine with ?(n) ~ k ? n (or even ~ k ? n^{2}), this would have consequences of the greatest importance. Namely, it would obviously mean that in spite of the undecidability of the Entscheidungsproblem, the mental work of a mathematician concerning YesorNo questions could be completely replaced by a machine. After all, one would simply have to choose the natural number n so large that when the machine does not deliver a result, it makes no sense to think more about the problem.
Similarly, Stephen Cook says^{[33]}
...it would transform mathematics by allowing a computer to find a formal proof of any theorem which has a proof of a reasonable length, since formal proofs can easily be recognized in polynomial time. Example problems may well include all of the CMI prize problems.
Research mathematicians spend their careers trying to prove theorems, and some proofs have taken decades or even centuries to find after problems have been statedfor instance, Fermat's Last Theorem took over three centuries to prove. A method that is guaranteed to find proofs to theorems, should one exist of a "reasonable" size, would essentially end this struggle.
Donald Knuth has stated that he has come to believe that P = NP, but is reserved about the impact of a possible proof:^{[34]}
[...] I don't believe that the equality P = NP will turn out to be helpful even if it is proved, because such a proof will almost surely be nonconstructive.
A proof that showed that P ? NP would lack the practical computational benefits of a proof that P = NP, but would nevertheless represent a very significant advance in computational complexity theory and provide guidance for future research. It would allow one to show in a formal way that many common problems cannot be solved efficiently, so that the attention of researchers can be focused on partial solutions or solutions to other problems. Due to widespread belief in P ? NP, much of this focusing of research has already taken place.^{[35]}
Also P ? NP still leaves open the averagecase complexity of hard problems in NP. For example, it is possible that SAT requires exponential time in the worst case, but that almost all randomly selected instances of it are efficiently solvable. Russell Impagliazzo has described five hypothetical "worlds" that could result from different possible resolutions to the averagecase complexity question.^{[36]} These range from "Algorithmica", where P = NP and problems like SAT can be solved efficiently in all instances, to "Cryptomania", where P ? NP and generating hard instances of problems outside P is easy, with three intermediate possibilities reflecting different possible distributions of difficulty over instances of NPhard problems. The "world" where P ? NP but all problems in NP are tractable in the average case is called "Heuristica" in the paper. A Princeton University workshop in 2009 studied the status of the five worlds.^{[37]}
Although the P = NP problem itself remains open despite a milliondollar prize and a huge amount of dedicated research, efforts to solve the problem have led to several new techniques. In particular, some of the most fruitful research related to the P = NP problem has been in showing that existing proof techniques are not powerful enough to answer the question, thus suggesting that novel technical approaches are required.
As additional evidence for the difficulty of the problem, essentially all known proof techniques in computational complexity theory fall into one of the following classifications, each of which is known to be insufficient to prove that P ? NP:
Classification  Definition 

Relativizing proofs  Imagine a world where every algorithm is allowed to make queries to some fixed subroutine called an oracle (a black box which can answer a fixed set of questions in constant time, such as a black box that solves any given traveling salesman problem in 1 step), and the running time of the oracle is not counted against the running time of the algorithm. Most proofs (especially classical ones) apply uniformly in a world with oracles regardless of what the oracle does. These proofs are called relativizing. In 1975, Baker, Gill, and Solovay showed that P = NP with respect to some oracles, while P ? NP for other oracles.^{[38]} Since relativizing proofs can only prove statements that are uniformly true with respect to all possible oracles, this showed that relativizing techniques cannot resolve P = NP. 
Natural proofs  In 1993, Alexander Razborov and Steven Rudich defined a general class of proof techniques for circuit complexity lower bounds, called natural proofs.^{[39]} At the time all previously known circuit lower bounds were natural, and circuit complexity was considered a very promising approach for resolving P = NP. However, Razborov and Rudich showed that, if oneway functions exist, then no natural proof method can distinguish between P and NP. Although oneway functions have never been formally proven to exist, most mathematicians believe that they do, and a proof of their existence would be a much stronger statement than P ? NP. Thus it is unlikely that natural proofs alone can resolve P = NP. 
Algebrizing proofs  After the BakerGillSolovay result, new nonrelativizing proof techniques were successfully used to prove that IP = PSPACE. However, in 2008, Scott Aaronson and Avi Wigderson showed that the main technical tool used in the IP = PSPACE proof, known as arithmetization, was also insufficient to resolve P = NP.^{[40]} 
These barriers are another reason why NPcomplete problems are useful: if a polynomialtime algorithm can be demonstrated for an NPcomplete problem, this would solve the P = NP problem in a way not excluded by the above results.
These barriers have also led some computer scientists to suggest that the P versus NP problem may be independent of standard axiom systems like ZFC (cannot be proved or disproved within them). The interpretation of an independence result could be that either no polynomialtime algorithm exists for any NPcomplete problem, and such a proof cannot be constructed in (e.g.) ZFC, or that polynomialtime algorithms for NPcomplete problems may exist, but it is impossible to prove in ZFC that such algorithms are correct.^{[41]} However, if it can be shown, using techniques of the sort that are currently known to be applicable, that the problem cannot be decided even with much weaker assumptions extending the Peano axioms (PA) for integer arithmetic, then there would necessarily exist nearlypolynomialtime algorithms for every problem in NP.^{[42]} Therefore, if one believes (as most complexity theorists do) that not all problems in NP have efficient algorithms, it would follow that proofs of independence using those techniques cannot be possible. Additionally, this result implies that proving independence from PA or ZFC using currently known techniques is no easier than proving the existence of efficient algorithms for all problems in NP.
While the P versus NP problem is generally considered unsolved,^{[43]} many amateur and some professional researchers have claimed solutions. Gerhard J. Woeginger maintains a list that, as of 2018, contains 62 purported proofs of P = NP, 50 of P ? NP, 2 proofs the problem is unprovable, and one proof that it is undecidable.^{[44]} An August 2010 claim of proof that P ? NP, by Vinay Deolalikar, a researcher at HP Labs, received heavy Internet and press attention after two leading specialists described it as " to be a relatively serious attempt".^{[45]} The proof has been reviewed publicly by academics,^{[46]}^{[47]} and Neil Immerman, an expert in the field, has pointed out two possibly fatal errors in the proof.^{[48]} In September 2010, Deolalikar was reported to be working on a detailed expansion of his attempted proof.^{[49]} However, opinions expressed by several notable theoretical computer scientists indicate that the attempted proof is neither correct nor a significant advancement in the understanding of the problem.^{[50]} This assessment prompted a May 2013 The New Yorker article to call the proof attempt "thoroughly discredited".^{[51]}
The P = NP problem can be restated in terms of expressible certain classes of logical statements, as a result of work in descriptive complexity.
Consider all languages of finite structures with a fixed signature including a linear order relation. Then, all such languages in P can be expressed in firstorder logic with the addition of a suitable least fixedpoint combinator. Effectively, this, in combination with the order, allows the definition of recursive functions. As long as the signature contains at least one predicate or function in addition to the distinguished order relation, so that the amount of space taken to store such finite structures is actually polynomial in the number of elements in the structure, this precisely characterizes P.
Similarly, NP is the set of languages expressible in existential secondorder logicthat is, secondorder logic restricted to exclude universal quantification over relations, functions, and subsets. The languages in the polynomial hierarchy, PH, correspond to all of secondorder logic. Thus, the question "is P a proper subset of NP" can be reformulated as "is existential secondorder logic able to describe languages (of finite linearly ordered structures with nontrivial signature) that firstorder logic with least fixed point cannot?".^{[52]} The word "existential" can even be dropped from the previous characterization, since P = NP if and only if P = PH (as the former would establish that NP = coNP, which in turn implies that NP = PH).
No algorithm for any NPcomplete problem is known to run in polynomial time. However, there are algorithms known for NPcomplete problems with the property that if P = NP, then the algorithm runs in polynomial time on accepting instances (although with enormous constants, making the algorithm impractical). However, these algorithms do not qualify as polynomial time because their running time on rejecting instances are not polynomial. The following algorithm, due to Levin (without any citation), is such an example below. It correctly accepts the NPcomplete language SUBSETSUM. It runs in polynomial time on inputs that are in SUBSETSUM if and only if P = NP:
// Algorithm that accepts the NPcomplete language SUBSETSUM. // // this is a polynomialtime algorithm if and only if P = NP. // // "Polynomialtime" means it returns "yes" in polynomial time when // the answer should be "yes", and runs forever when it is "no". // // Input: S = a finite set of integers // Output: "yes" if any subset of S adds up to 0. // Runs forever with no output otherwise. // Note: "Program number M" is the program obtained by // writing the integer M in binary, then // considering that string of bits to be a // program. Every possible program can be // generated this way, though most do nothing // because of syntax errors. FOR K = 1...? FOR M = 1...K Run program number M for K steps with input S IF the program outputs a list of distinct integers AND the integers are all in S AND the integers sum to 0 THEN OUTPUT "yes" and HALT
If, and only if, P = NP, then this is a polynomialtime algorithm accepting an NPcomplete language. "Accepting" means it gives "yes" answers in polynomial time, but is allowed to run forever when the answer is "no" (also known as a semialgorithm).
This algorithm is enormously impractical, even if P = NP. If the shortest program that can solve SUBSETSUM in polynomial time is b bits long, the above algorithm will try at least 2^{b}  1 other programs first.
Conceptually speaking, a decision problem is a problem that takes as input some string w over an alphabet ?, and outputs "yes" or "no". If there is an algorithm (say a Turing machine, or a computer program with unbounded memory) that can produce the correct answer for any input string of length n in at most cn^{k} steps, where k and c are constants independent of the input string, then we say that the problem can be solved in polynomial time and we place it in the class P. Formally, P is defined as the set of all languages that can be decided by a deterministic polynomialtime Turing machine. That is,
where
and a deterministic polynomialtime Turing machine is a deterministic Turing machine M that satisfies the following two conditions:
NP can be defined similarly using nondeterministic Turing machines (the traditional way). However, a modern approach to define NP is to use the concept of certificate and verifier. Formally, NP is defined as the set of languages over a finite alphabet that have a verifier that runs in polynomial time, where the notion of "verifier" is defined as follows.
Let L be a language over a finite alphabet, ?.
L ? NP if, and only if, there exists a binary relation and a positive integer k such that the following two conditions are satisfied:
A Turing machine that decides L_{R} is called a verifier for L and a y such that (x, y) ? R is called a certificate of membership of x in L.
In general, a verifier does not have to be polynomialtime. However, for L to be in NP, there must be a verifier that runs in polynomial time.
Let
Clearly, the question of whether a given x is a composite is equivalent to the question of whether x is a member of COMPOSITE. It can be shown that COMPOSITE ? NP by verifying that it satisfies the above definition (if we identify natural numbers with their binary representations).
COMPOSITE also happens to be in P, a fact demonstrated by the invention of the AKS primality test.^{[53]}
There are many equivalent ways of describing NPcompleteness.
Let L be a language over a finite alphabet ?.
L is NPcomplete if, and only if, the following two conditions are satisfied:
Alternatively, if L ? NP, and there is another NPcomplete problem that can be polynomialtime reduced to L, then L is NPcomplete. This is a common way of proving some new problem is NPcomplete.
The film Travelling Salesman, by director Timothy Lanzone, is the story of four mathematicians hired by the US government to solve the P versus NP problem.^{[54]}
In the sixth episode of The Simpsons seventh season "Treehouse of Horror VI", the equation P=NP is seen shortly after Homer accidentally stumbles into the "third dimension".^{[55]}^{[56]}
In the second episode of season 2 of Elementary, "Solve for X" revolves around Sherlock and Watson investigating the murders of mathematicians who were attempting to solve P versus NP.^{[57]}^{[58]}