NPCompletenessNP完全性.pptVIP

NP-Completeness Problems Proofs Approximations Decision Problems Given Some Universal Set X, Let R be a subset of X. The decision problem for R is: Given an arbitrary element a of X, does a belong to R? Note: X is usually assumed to be a set of strings, but this can be interpreted loosely. The class P Let R be a set of strings. If there exists a Polynomial time algorithm: O(n), O(n2), ... that solves the decision problem for R, Then R is in the class P. Note the use of the Big O notation. Sorting, O(n lg n), is in P. Binary Search, O(lg n), is in P. What is Nondeterminism? A Nondeterministic Machine Three types of State Machines Deterministic Conversions Any Non-Deterministic FSM (no aux. storage) Can be converted to a deterministic machine in quickly. (All FSMs run in O(n) time.) Non-Deterministic PDM’s are more powerful than deterministic PDM’s. All PDM’s run in O(n) time, but converting from Non-Det. PDM to a real algorithm might produce an O(n3) algorithm. TM Deterministic Conversion Deterministic and Non-Deterministic TM’s are equally Powerful. Any Non-Deterministic TM can be converted to a deterministic TM The conversion may cause an exponential slow-down in running time. (We don’t know if this is neccessary, but no one has proven that it isn’t.) Non-Deterministic Algorithms Working with Turing Machines is too difficult to be practical. Since TM’s and programming languages are equivalent, TM’s are always represented as HLL programs. NonDeterminism is introduced using the statement: V := SELECT(A,B,C,...); The SELECT Statement The SELECT statement cannot be implemented. SELECT is equivalent to assigning a CONSTANT to a variable. SELECT represents several potential assignment statements that COULD be coded in a deterministic program. Accepting and Rejecting Since we are only concerned with decision problems, we insist that a program accept a string by executing a special ACCEPT statement. Deterministic programs must execute a REJECT statement to reject a