1
CSE 421
Algorithms
Richard Anderson
Lecture 27
NP Completeness
Announcements
• Final Exam
– Monday, December 11, 2:304:20 pm
• Closed book, closed notes
– Practice final and answer key available
• HW 9, due Friday, 1:30 pm
• This week’s topic
– NPcompleteness
– Reading: 8.18.8: Skim the chapter, and pay more
attention to particular points emphasized in class
– It will be on the final
Algorithms vs. Lower bounds
• Algorithmic Theory
– What we can compute
• I can solve problem X with resources R
– Proofs are almost always to give an algorithm
that meets the resource bounds
• Lower bounds
– How do we show that something can’t be
done?
Theory of NP Completeness
The Universe
NPComplete
NP
P
Polynomial Time
• P: Class of problems that can be solved in
polynomial time
– Corresponds with problems that can be
solved efficiently in practice
– Right class to work with “theoretically”
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document2
What is NP?
• Problems solvable in nondeterministic
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '06
 RichardAnderson
 Algorithms, Computational complexity theory, NPcomplete problems, NPcomplete, Boolean satisfiability problem, polynomial time, Hamiltonian Circuit Hamiltonian Circuit

Click to edit the document details