算法设计-典型的规约算法-重要.pdfVIP

Your Chance to Win a Turing Outline: Day 2 Award • We’ve seen that there are a bunch of problems that seem to be hard. • It is generally believed that P ≠ NP, i.e. there • Today we’ll see how these problems are problems in NP that are not in P relate to one another. › But no one has been able to show even one • Def: P is reducible to P if there is a 1 2 such problem! conversion from an instance X of P to an › This is the fundamental open problem in 1 instance Y of P such that P is yes for X theoretical computer science 2 1 › Nearly everyone has given up trying to prove it. iff P is yes for Y. 2 Instead, theoreticians prove theorems about what follows once we assume P ≠ NP ! Clique k-Clique problem • Is there a clique of size k in the graph? Vertex cover How are they related? • Set of vertices so that each edge is • How might we reduce clique to vertex