{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Lecture27 - Announcements Final Exam CSE 421 Algorithms...

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

1 CSE 421 Algorithms Richard Anderson Lecture 27 NP Completeness 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? Theory of NP Completeness The Universe NP-Complete 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 Document
2 What is NP? • Problems solvable in non-deterministic
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 ]}

### Page1 / 4

Lecture27 - Announcements Final Exam CSE 421 Algorithms...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online