Cook’s Theorem - Baylor University库克定理-贝勒大学.pptVIP

Cook’s Theorem The Foundation of NP-Completeness Theoretical Foundations An alphabet ?={s1,s2, … ,sk} is a set of symbols The set ?* is the set of all strings created using the symbols of ?. A problem is a subset X??* An algorithm A solves X, if given any string x??* A accepts x if and only if x?X. Decision Problems Algorithms Decision Problems are Set-Membership Problems The sets are all assumed to be sets of strings Deterministic Algorithms Accept or Reject strings Non-Deterministic Algorithms Accept strings, but generally do not Reject strings The Elements of NP A problem X is an element of NP if there is a non-deterministic polynomial-time algorithm that solves X. All algorithms can be represented as Turing Machines Therefore, each X?NP has a Non-Deterministic Turing Machine MX that accepts the elements of X in polynomial time What The Theorem Must Do Given a problem X, and a string x??*, create a Boolean expression in polynomial time The Boolean expression must be in CNF form The Boolean expression must be satisfiable if and only if x?X We can make use of MX and the polynomial time bound p(n) of MX. The Structure of MX I Any Turing Machine has a State Diagram, and a tape The tape is assumed to be a linear set of squares, each containing a symbol There is a blank symbol b, that occupies any un-accessed squares of the tape The tape extends indefinitely in both directions The Structure of MX II The strings to be processed by MX are formed from the symbols from the set ? The symbols of ? may appear on the tape There may be additional tape-only symbols, taken from the set ? The blank b?? and b??. The Structure of MX III The set of states is Q There are three distinguished states of Q, q0, qy and qn. (qn is not strictly required.) When MX is in state qy or qn, it is halted and no more transitions are possible. q0 is the start state The Structure of MX IV The set ? determines the legal transitions The set of tape symbols T=????{b}?? ??Q?T?Q?T?{L,R} If (qi,sj,qk,sl