This preview shows pages 1–5. Sign up to view the full content.
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 Document
Unformatted text preview: graph: (NN1) P and NP P NPComplete NP P and NP NP Complete Stands for the hardest decision problems in NP If any NPComplete problem can be solved in polynomial time, then P = NP Some examples of NPComplete are: Is there a traveling salesperson tour for graph G of cost less than K? Is there a Steiner Tree for graph G of cost less than K? P and NP NPComplete NP CONP P C0NPComplete...
View
Full
Document
This note was uploaded on 08/26/2009 for the course MATH 224 taught by Professor Waxman during the Fall '08 term at Southern Illinois University Edwardsville.
 Fall '08
 Waxman
 Math, Multiplication

Click to edit the document details