04Complexity.ppt

Design and Analysis of Algorithms 4. NP and Computational Intractability Algorithm Design Patterns and Anti-Patterns Algorithm design patterns. Ex. Greedy. O(n log n) interval scheduling. Divide-and-conquer. O(n log n) FFT. Dynamic programming. O(n2) edit distance. Duality. O(n3) bipartite matching. Reductions. Local search. Randomization. Algorithm design anti-patterns. NP-completeness. O(nc) algorithm unlikely. PSPACE-completeness. O(nc) certification algorithm unlikely. Undecidability. No algorithm possible. 4.1 Polynomial-Time Reductions Classify Problems According to Computational Requirements Q. Which problems will we be able to solve in practice? A working definition. [von Neumann 1953, Godel 1956, Cobham 1964, Edmonds 1965, Rabin 1966] Those with polynomial-time algorithms. Classify Problems Desiderata. Classify problems according to those that can be solved in polynomial-time and those that cannot. Frustrating news. Huge number of fundamental problems have defied classification for decades. This chapter. Show that these fundamental problems are computationally equivalent and appear to be different manifestations of one really hard problem. Polynomial-Time Reduction Desiderata. Suppose we could solve X in polynomial-time. What else could we solve in polynomial time? Reduction. Problem X polynomial reduces to problem Y if arbitrary instances of problem X can be solved using: Polynomial number of standard computational steps, plus Polynomial number of calls to oracle that solves problem Y. Notation. X ? P Y. Polynomial-Time Reduction Purpose. Classify problems according to relative difficulty. Design algorithms. If X ? P Y and Y can be solved in polynomial-time, then X can also be solved in polynomial time. Establish intractability. If X ? P Y and X cannot be solved in polynomial-time, then Y cannot be solved in polynomial time. Establish equivalence. If X ? P Y and Y ? P X, we use notation X ? P Y. Reduction By Sim