NPCompleteProblems课程.pptVIP

NP-Complete Problems Polynomial time vs exponential time Polynomial O(nk), where n is the input size (e.g., number of nodes in a graph, the length of strings , etc) of our problem and k is a constant (e.g., k=1, 2, 3, etc). Exponential time: 2n or nn. n= 2, 10, 20, 30 2n: 4 1024 1 million 1000 million Suppose our computer can solve a problem of size k (i.e., compute 2k operations) in a hour/week/month. If the new computer is 1024 times faster than ours, then the new computer can solve the problem of size k+10 in the same time.