lecture-mit.pptVIP

Today Problem set 9 out (due next Thursday) Topics: Complexity Theory Optimization versus Decision Problems P and NP Efficient Verification NP- Completeness Section: Network Flow So Far... Algorithmic Techniques : Divide and Conquer, Greedy, Dynamic Programming, DFS) Data Structures: Trees, Heaps, Graphs Practice: many problems even if try every trick in the book, nothing seems to work Some Problems: Intrinsic Difficulty -- Domain of complexity Theory -- 6.045 Complexity Theory Halting problem: Given a computer program and an input, does the program halt on that input? -- Unsolvable Today: