This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document Spring '06
 Ramachandran
 Algorithms, Computational complexity theory, NPcomplete, TSP, Boolean satisfiability problem, polynomial time, verification algorithm

Click to edit the document details