Computability and computational complexity Lecture 12: On P vs NP Ion Petre Computer Science, Åbo Akademi University Fall 2015 http://users.abo.fi/ipetre/computability/ December 9, 2015 http://users.abo.fi/ipetre/computability/ 1 Content n The map of NP n Oracle machines n Settling P vs NP through oracles n The P vs NP question q some historical pointers q significance q possible answers q possible strategies q possible consequences December 9, 2015 http://users.abo.fi/ipetre/computability/ 2 The map of NP n The class of NP-complete problems is very useful in classifying problems in NP q Crucial in settling the question of whether or not P¹NP q There are problems that are not known to be in either P or NP-complete n GRAPH ISOMORPHISM is in NP but not known to be either NP-complete or in P q Laszlo Babai (2015): GI can be solved with a quasipolynomial algorithm running in 2O(logc(n))!! q SUBGRAPH ISOMORPHISM is NP-complete! (for graphs G and H, does G have a subgraph that is isomorphic to H?) n Question: are there problems that are neither in P nor NP-complete? q Three cases possible in principle: 1. NP contains three distinct subclasses: P, NP-complete, problems that are neither 2. NP contains only two classes: P and NP-complete 3. NP contains only one class, i.e. P=NP q In fact, the second case is not possible! December 9, 2015 http://users.abo.fi/ipetre/computability/ 3 The map of NP NP NP n Theorem. If P¹NP, then there is a language in NP which is neither P, nor is it NP-complete. NP-complete q Proof – skip it. P=NP= ¹Æ NP-complete n Note the unary case: q Theorem (Berman, 1978). If there exists P an NP-complete unary language UÍ{0}*, then P=NP. NP NP-complete P December 9, 2015 http://users.abo.fi/ipetre/computability/ 4 Oracles n Analogy is a favorite method of reasoning and of proving results q Given a difficult problem, we look for a “similar” problem that has occurred elsewhere, in an “alternative universe” n Question: How would the problem P¹NP look in an “alternative universe”? n Additional questions: What is an “alternative universe” for computational complexity? What is “our universe” for computational complexity? q Our universe: no computation is for free! q Alternative universe: some (not all) computations are perhaps for free! n For example, at some point in a computation, the algorithm asks a question, such as whether a certain Boolean formula it currently considers is satisfiable, and it gets an instantaneous answer to it n This is the world of “oracles”, where an oracle for SAT can answer all our SAT questions for free (instantaneously) n Is P¹NP in the alternative universe? q Surprising answer! December 9, 2015 http://users.abo.fi/ipetre/computability/ 5 Oracles – continued n Definition. A Turing machine M? with oracle is a multi-tape, deterministic TM that has a special tape called the query tape, and three special states: q q? (query state) q qYES, qNO (answer states) Let AÍS* be an arbitrary language that will function as an oracle for M?. The computation of M? with oracle A proceeds like an ordinary TM, except for transitions from the query state: ? q from q?, M moves to either qYES or qNO depending on whether the current string on the query tape is in A or not q the answer thus allows the machine to change its computation The computation of M? with oracle A on input x is denoted MA(x). n Time complexity defined exactly as for ordinary TM – even the query steps only count as one, no matter how difficult the query is to decide n Nondeterministic TM with oracles defined exactly as before n If C is any (deterministic or nondeterministic) time complexity class, we can define CA to be the class of languages decided (or accepted) by machines of the same type and time bound as in C, only that they have access to oracle A December 9, 2015 http://users.abo.fi/ipetre/computability/ 6 Deciding P vs. NP with oracles n Theorem. There is an oracle A for which PA=NPA. q Proof. The idea is to consider an oracle that either makes deterministic computations much more powerful, or renders nondeterminism powerless q There is one complexity result that we discussed in Lecture 6 where nondeterminism makes no difference: PSPACE=NPSPACE q Consider as an oracle A any PSPACE-complete language q Then PSPACE Í PA Í NPA Í NPSPACE = PSPACE n First inclusion: since A is PSPACE-complete, any language in PSPACE can be decided by a polynomial-time deterministic machine that reduces it first to A and then uses the oracle once n Second inclusion: trivial n Third inclusion: any nondeterministic machine with oracle A can be simulated by a nondeterministic polynomial space-bounded machine where the query to A is replaced with the computation A(x) (which is polynomially space-bounded because A is in PSPACE) n Fourth equality: by Savitch’s theorem (see Lecture 6) December 9, 2015 http://users.abo.fi/ipetre/computability/ 7 Deciding P vs NP with oracles – continued n Theorem. There is an oracle B for which PB¹NPB. q Proof. We skip it here. q Only point out that we need an oracle B that greatly enhances the power of nondeterminism B B n q The language used in the proof with LÎ NP -P is L={0 : there is xÎB with |x|=n} December 9, 2015 http://users.abo.fi/ipetre/computability/ 8 n Conclusions. q Reasoning by analogy does not work for the P ¹ NP problem q The question P¹NP will not be settled by a proof that can be carried over oracle machines, i.e., by proofs that “transcend” worlds n note that many of the techniques discussed in this course can be carried over verbatim from one world to another q Using oracles can be useful as an exploratory proof technique. Proving that CA¹DA shows that it is quite possible that C¹D and that probably there is no trivial proof that C=D December 9, 2015 http://users.abo.fi/ipetre/computability/ 9 The remaining of this lecture is based on R.J.Lipton – “The P=NP question and Gödel’s lost letter”, Springer 2010 THE P=NP QUESTION December 9, 2015 http://users.abo.fi/ipetre/computability/ 10 History n 1956: Gödel writes a letter to von Neumann where he formulates a problem very closely related to P vs NP q Gödel’s “lost letter” n 1971: Stephen Cook formalizes the notion of reduction, defines NP-completeness, proves that SAT is NP-complete, formulates the question of whether P=NP (albeit not in this form) q Very few pay attention q Results formulated from the perspective of logic (similarly as Gödel) q Same results/notions independently by Leonid Levin in USSR n 1972: Richard Karp writes a paper where he formulates the question of whether P=NP in the form that we now know, proves that 21 combinatorial problems are NP-complete q Places Cook’s results in a central position in Computer Science q Approaches the results from the point of view of practical computer science q Shows that it has wider consequences than Cook and Gödel thought q Helps galvanize the computer science community quickly n 1972: Michael Rabin quickly organizes a conference where Karp presents his work, publishes a book including Karp’s paper, giving it more visibility December 9, 2015 http://users.abo.fi/ipetre/computability/ 11 Solving the problem n Proving P=NP q Direct method: Choose your favourite NP-complete problem and give it a polynomial algorithm q Indirect method: contradict a result that holds if P=NP n Proving P¹NP q Direct method: Choose your favourite NP-complete problem and prove that it cannot have a polynomial-time deterministic algorithm q Indirect method: contradict a result that holds if P¹NP December 9, 2015 http://users.abo.fi/ipetre/computability/ 12 Is P=NP well posed? n Compare with the Riemann Hypothesis q Prime number theorem: p(x), the number of primes less than x, is well x approximated by the logarithmic integral: p(x)=ò0 dt/log(t)+E(x) and E(x)=o(x/log x) is the error term 1/2 q RH implies that the error term is order x , ignoring logarithmic terms q RH is “binary”: having even one single zero not on the “critical line” destroys the bound December 9, 2015 http://users.abo.fi/ipetre/computability/ 13 Is P vs NP well posed? – continued n P vs NP: very different type of behavior q There might be an algorithm for SAT running in a reasonable time bound n This would be a great result, with extraordinary practical consequences q There might be an algorithm for SAT that is polynomial but with a very high exponent, say O(n10) n It would solve the problem without much consequence for practical computer science (e.g. for cryptography) q There might be an algorithm for SAT that is polynomial in a very weak sense, e.g. with a running time 100 n222 n No consequences for practical computer science c q There might be an algorithm for SAT running in time n , with an unknown constant c December 9, 2015 http://users.abo.fi/ipetre/computability/ 14 So what if P¹NP? n Possible proofs that P¹NP.