# Lecture27 - CSE 421 Algorithms Richard Anderson Lecture 27...

This preview shows pages 1–8. Sign up to view the full content.

CSE 421 Algorithms Richard Anderson Lecture 27 NP Completeness

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Announcements Final Exam Monday, December 11, 2:30-4:20 pm Closed book, closed notes Practice final and answer key available HW 9, due Friday, 1:30 pm This week’s topic NP-completeness Reading: 8.1-8.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?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Theory of NP Completeness Most significant mathematical theory associated with computing
The Universe NP-Complete NP P

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
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”
What is NP?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.
• Fall '06
• RichardAnderson
• Algorithms, Computational complexity theory, NP-complete problems, NP-complete, Boolean satisfiability problem, polynomial time, Hamiltonian Circuit Hamiltonian Circuit

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern