NP完全性问题 NP-Complete Problems.ppt

Complexity NPC NP-Complete Problems We can solve any problem(!)(?) … but perhaps not with a computer! Some problems are not computable: The Halting Problem: Write a function boolean halts(Program p, Input i); which returns true if p halts on input i, and false if it doesn’t. A bonus homework exercise? If we could write the halts function, then we could also write: boolean loopIfHalts(Program p, Input i) { if (halts(p,i)) while (true) ; else return true; } boolean testSelf(Program p) { return loopIfHalts(p,p); } What is testSelf(testSelf)? Proof by contradiction: boolean halts(Program p,Input i); which returns true if p halts on input i, and false if it doesn’t. boolean loopIfHalts(Program p, Input i) { if (halts(p,i)) while (true) ; else return true; } boolean tS(Program p) {return loopIfHalts(p,p); } Assume: tS(tS) halts and returns true. loopIfHalts(tS,tS) = true halts(tS,tS) = false tS(tS) doesnt halt which is a contradiction Assume: tS(tS) does not halt halts(tS,tS) = true contradiction We can solve any computable problem! … but perhaps not with an “efficient” algorithm. Of course we could solve any problem by: Enumerating all possible solutions; Testing each one to see if it is a solution. That may take a long time … … but sometimes it seems that’s the best we can do! Circuit Satisfiability: Find an assignment of truth values to the inputs of a logic circuit, that results in an output of 1. Hamiltonian Cycles: Given a graph G, find a simple cycle that contains each vertex in G. Subset Sum: Given a finite set of natural numbers S and a target natural number t, find a subset S’ of S whose sum is t. For example, find: S’?{1,3,6,34,93,243,654,1040,1436,1879} with sum S’ = 2361. What is a problem? Abstractly, a problem is a set of pairs (I,S), where I is an instance of the problem and S is a solution. A decision problem is a problem in which the solutions are either yes