NP完全问题 NP-COMPLETENESS.pptVIP

CHAPTER 34: NP-COMPLETENESS Polynomial-time algorithms : on inputs of size n, their worst-case running time is O(nk) for some constant k. Superpolynomial time algorithms: it can be solved, but not in time O(nk) for any constant k. Generally, we think of problems that are solvable by polynomial-time algorithms as being tractable, and problems that require superpolynomial time as being intractable. There are also problems that cannot be solved by any computer, no matter how much time is provided. NP-complete problems, whose status is unknown. No polynomial-time algorithm has yet been discovered for an NP-complete problem, nor has anyone yet been able to prove a superpolynomial-time lower bound for any of them. A particularly tantalizing aspect of the NP-complete problems is that several of them seem on the surface to be similar to problems that have polynomial-time algorithms. Shortest vs. longest paths Euler tour vs. hamiltonian 2-CNF satisfiability vs. 3-CNF satisfiability NP-completeness and the classes P and NP The class P consists of those problems that are solvable in polynomial time. The class NP consists of those problem that are “verifiable” (能证实的) in polynomial time. Any problem in P is also in NP, that is . A problem is in the class NPC if it is in NP and is as “hard” as any problem in NP. Overview of showing problems to be NP-complete The techniques we use to show that a particular problem is NP-complete differ from the techniques used throughout of this book to design and analyze algorithms. We rely on three key concepts in showing a problem to be NP-complete: Decision problems vs. optimization Reductions A first NP-complete problem 34.1 Polynomial time All problems in P are generally regarded as tractable, but for philosophical ,not for mathematical, reasons. We can offer three supporting arguments: 1. There are very few practical problems that require time on the order of such a high-degree polynomial-time Θ(n100). 2. For many reasonab