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 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: 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 NPcomplete problems NPcomplete 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.
 Fall '11
 RUDRA

Click to edit the document details