NP-Complete Problems
NP-Complete Problems. Polynomial time vs exponential time Polynomial O(n k ), 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: 2 n or n n .
593 views • 50 slides