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 Document Spring '04
 ErikDemaine
 Algorithms, Graph Theory, Computational complexity theory, NPcomplete, Boolean satisfiability problem, Prof. Piotr Indyk, Piotr Indyk

Click to edit the document details