CSE331 Lecture 39

CSE331 Lecture 39 - verify Alternate NP definition Guess...

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

Lecture 39 CSE 331 Dec 5, 2011

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

View Full Document
Review Sessions etc. Atri: (at least ½ of) class Friday Jiun-Jie: Extra office hour Friday Jesse: Review Session on Mon, Dec 12 (pick time slot on blog) Temp grades hopefully by end of this week All grades have been uploaded to UBLearns
All you ever wanted to know about the final exam…

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

View Full Document
Need volunteers for today
Longest path problem Given G, does there exist a simple path of length n-1 ?

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

View Full Document
Longest vs Shortest Paths
Two sides of the “same” coin Shortest Path problem Can be solved by a polynomial time algorithm Is there a longest (simple) path of length n-1 ? Given a path can verify in polynomial time if the answer is yes

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

View Full Document
Poly time algo for longest path?
P vs NP question P : problems that can be solved by poly time algorithms NP : problems that have polynomial time verifiable witness to optimal solution Is P=NP? Is P=NP? Alternate NP definition: Guess witness and

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

View Full Document

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

View Full Document

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.

Unformatted text preview: verify! Alternate NP definition: Guess witness and verify! Proving P ≠ NP Pick any one problem in NP and show it cannot be solved in poly time Pretty much all known proof techniques provably will not work Pretty much all known proof techniques provably will not work Proving P = NP Will make cryptography collapse Compute the encryption key! Compute the encryption key! Prove that all problems in NP can be solved by polynomial time algorithms NP NP-complete problems NP-complete problems Solving any ONE problem in here in poly time will prove P=NP! Solving any ONE problem in here in poly time will prove P=NP! If you are curious for more CSE431: Algorithms CSE 396: Theory of Computation Nice survey on P vs. NP Today’s agenda Overview of how things work in the P vs NP world...
View Full Document

This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.

Page1 / 14

CSE331 Lecture 39 - verify Alternate NP definition Guess...

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

View Full Document
Ask a homework question - tutors are online