This preview shows pages 1–9. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Outline 1 NPCompleteness Theory 2 Limitation of Computation 3 Examples 4 Decision Problems 5 Verication Algorithm 6 NonDeterministic Algorithm 7 NPComplete Problems 8 Cooks Theorem 9 Turing Machine 10 ChurchTuring Thesis 11 How to prove a problem is NPcomplete? 12 Examples of NPC Proofs c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 1 / 110 NPCompleteness Theory The topics we discussed so far are positive results: c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 110 NPCompleteness Theory The topics we discussed so far are positive results: Given a problem, how to design efcient algorithms for solving it. c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 110 NPCompleteness Theory The topics we discussed so far are positive results: Given a problem, how to design efcient algorithms for solving it. NPCompleteness (NPC for sort) Theory is negative results . c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 110 NPCompleteness Theory The topics we discussed so far are positive results: Given a problem, how to design efcient algorithms for solving it. NPCompleteness (NPC for sort) Theory is negative results . It studies the problems that cannot be solved efciently . c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 110 NPCompleteness Theory The topics we discussed so far are positive results: Given a problem, how to design efcient algorithms for solving it. NPCompleteness (NPC for sort) Theory is negative results . It studies the problems that cannot be solved efciently . Why we study negative results? c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 110 NPCompleteness Theory The topics we discussed so far are positive results: Given a problem, how to design efcient algorithms for solving it. NPCompleteness (NPC for sort) Theory is negative results . It studies the problems that cannot be solved efciently . Why we study negative results? In some sense, the negative results are more important than positive results: c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 110 NPCompleteness Theory The topics we discussed so far are positive results: Given a problem, how to design efcient algorithms for solving it. NPCompleteness (NPC for sort) Theory is negative results . It studies the problems that cannot be solved efciently . Why we study negative results? In some sense, the negative results are more important than positive results: The negative result may say that a given problem Q cannot be solved in polynomial time....
View
Full
Document
This note was uploaded on 02/27/2012 for the course CSE 431/531 taught by Professor Xinhe during the Fall '11 term at SUNY Buffalo.
 Fall '11
 XINHE
 Algorithms

Click to edit the document details