6.006- Introduction to Algorithms. Lecture 24 NP-completeness (The Dismal Computer Science). Prof . Constantinos Daskalakis. Tractable Problems. We have seen many problems that can be solved in polynomial time . e.g. finding the shortest path in a graph e.g.2 sorting n numbers
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
(The Dismal Computer Science)
Prof. Constantinos Daskalakis
true for reasonable input size [but not for “Internet-size”, or “galaxy-size” inputs]
n x n checkers
count from 1 to n
sort n numbers
SOLVABLE WITHIN POLY-TIME
SOLVABLE WITHIN EXPONENTIAL-TIME
Short Answer: We don’t know how to prove such statements.
Don’t even have general technique to show that there is no O(n) algorithm
Algorithm for P
Algorithm for Q
input X to P
input Y to Q