Lecture 30 P NP and NP Complete Problems

Lecture 30. P, NP and NP Complete Problems 1

Recap l l 2 Data compression is a technique to compress the data represented either in text, audio or image form. Two important compress techniques are lossy and lossless compression. LZW is the foremost technique for general purpose data compression due to its simplicity and versatility. LZW compression uses a code table, with 4096 as a common choice for the number of table entries.

Optimization & Decision Problems l Decision problems – l Optimization problems – l Given an input and a question regarding a problem, determine if the answer is yes or no Find a solution with the “best” value Optimization problems can be cast as decision problems that are easier to study – E. g. : Shortest path: G = unweighted directed graph l Find a path between u and v that uses the fewest edges 3 l Does a path exist from u to v consisting of at most k edges?

Algorithmic vs Problem Complexity l l The algorithmic complexity of a computation is some measure of how difficult is to perform the computation (i. e. , specific to an algorithm) The complexity of a computational problem or task is the complexity of the algorithm with the lowest order of growth of complexity for solving that problem or performing that task. – e. g. the problem of searching an ordered list has at most lgn time complexity. l 4 Computational Complexity: deals with classifying problems by how hard they are.

Computational Complexity Theory 5 l In computer science, computational complexity theory is the branch of theory of computation that studies the resources, or cost, of the computation required to solve a given computational problem. l The relative computational difficulty of computable functions is the subject matter of computational complexity. l Complexity theory analyzes the difficulty of computational problems in terms of many different computational resources. l Example: looking up something in a dictionary has only logarithmic complexity because a double sized dictionary only has to be opened one time more (e. g. exactly in the middle - then the problem is reduced to the half).

Complexity Classes 6 l A complexity class is the set of all of the computational problems which can be solved using a certain amount of a certain computational resource. l The complexity class P is the set of decision problems that can be solved by a deterministic machine in polynomial time. This class corresponds to an intuitive idea of the problems which can be effectively solved in the worst cases. l The complexity class NP is the set of decision problems that can be solved by a non-deterministic machine in polynomial time. This class contains many problems that people would like to be able to solve effectively. All the problems in this class have the property that their solutions can be checked effectively.

Complexity Classes (taxonomy) Decision Problem Type 0 (recursively enumerable) Undecidable Decidable PSPACE-Complete Type 1 (context sensitive) NP Co-NP NP-Complete P Type 2 (context free) Type 3 (regular) 7 P-Complete Strict subset relationship Set equality is unknown

Deterministic (Turing) Machine 8 l Deterministic or Turing machines are extremely basic symbolmanipulating devices which — despite their simplicity — can be adapted to simulate the logic of any computer that could possibly be constructed. l They were described in 1936 by Alan Turing. Though they were intended to be technically feasible, Turing machines were not meant to be a practical computing technology, but a thought experiment about the limits of mechanical computation; thus they were not actually constructed. l Studying their abstract properties yields many insights into computer science and complexity theory. l Turing machines capture the informal notion of effective method in logic and mathematics, and provide a precise definition of an algorithm or 'mechanical procedure'.

Nondeterministic (Turing) Machine l l l 9 In theoretical computer science, a non-deterministic Turing machine (NTM) is a Turing machine whose control mechanism works like a non-deterministic finite automaton. An ordinary (deterministic) Turing machine (DTM) has a transition function that, for a given state and symbol under the tape head, specifies three things: – the symbol to be written to the tape – the direction (left or right) in which the head should move – the subsequent state of the finite control An NTM differs in that the state and tape symbol no longer uniquely specify these things - many different actions may apply for the same combination of state and symbol.

Complexity Class P l l l 10 P is the complexity class containing decision problems which can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time. P is often taken to be the class of computational problems which are "efficiently solvable" or "tractable“. Problems that are solvable in theory, but cannot be solved in practice, are called intractable. There exist problems in P which are intractable in practical terms; for example, some require at least n 1000000 operations. P is known to contain many natural problems, including the decision versions of linear programming, calculating the greatest common divisor, and finding a maximum matching. In 2002, it was shown that the problem of determining if a number is prime is in P.

Complexity Class NP l l 11 In computational complexity theory, NP ("Non-deterministic Polynomial time") is the set of decision problems solvable in polynomial time on a non-deterministic Turing machine. It is the set of problems that can be "verified" by a deterministic Turing machine in polynomial time. All the problems in this class have the property that their solutions can be checked effectively. This class contains many problems that people would like to be able to solve effectively, including – the Boolean satisfiability problem (SAT) – the Hamiltonian path problem (special case of TSP) – the Vertex cover problem.

Complexity Class NP-Complete l l 12 In complexity theory, the NP-complete problems are the most difficult problems in NP ("non-deterministic polynomial time") in the sense that they are the ones most likely not to be in P. If one could find a way to solve any NP-complete problem quickly (in polynomial time), then they could use that algorithm to solve all NP problems quickly. At present, all known algorithms for NP-complete problems require time that is super polynomial in the input size. To solve an NP-complete problem for any nontrivial problem size, generally one of the following approaches is used: – Approximation – Probabilistic – Special cases – Heuristic

Complexity Class NP-Complete (cont) Some well-known problems that are NP-complete are: – – – – – 13 – Boolean satisfiability problem (SAT) N-puzzle Knapsack problem Hamiltonian cycle problem Traveling salesman problem Subgraph isomorphism problem Subset sum problem Clique problem Vertex cover problem Independent set problem Graph coloring problem

Complexity Classes P and NP 14

Class of “P” Problems l Class P consists of (decision) problems that are solvable in polynomial time l Polynomial-time algorithms – l Examples of polynomial time: – l O(n 2), O(n 3), O(1), O(n lg n) Examples of non-polynomial time: – 15 Worst-case running time is O(nk), for some constant k O(2 n), O(n!)

Tractable/Intractable Problems l Problems in P are also called tractable l Problems not in P are intractable or unsolvable l – Can be solved in reasonable time only for small inputs – Or, can not be solved at all Are non-polynomial algorithms always worst than polynomial algorithms? - n 1, 000 is technically tractable, but really impossible - nlog log n is technically intractable, but easy 16

Example of Unsolvable Problem Turing discovered in the 1930’s that there are problems unsolvable by any algorithm. l The most famous of them is the halting problem l – 17 Given an arbitrary algorithm and its input, will that algorithm eventually halt, or will it continue forever in an “infinite loop? ”

Examples of Intractable Problems 18

Intractable Problems l Can be classified in various categories based on their degree of difficulty, e. g. , – – – l 19 NP NP-complete NP-hard Let’s define NP algorithms and NP problems

Nondeterministic and NP Algorithms Nondeterministic algorithm = two stage procedure: 1) Nondeterministic (“guessing”) stage: generate randomly an arbitrary string that can be thought of as a candidate solution (“certificate”) 2) Deterministic (“verification”) stage: take the certificate and the instance to the problem and returns YES if the certificate represents a solution NP algorithms (Nondeterministic polynomial) 20 verification stage is polynomial

Class of “NP” Problems l Class NP consists of problems that could be solved by NP algorithms – l i. e. , verifiable in polynomial time If we were given a “certificate” of a solution, we could verify that the certificate is correct in time polynomial to the size of the input l 21 Warning: NP does not mean “non-polynomial”

Hamiltonian Cycle l Given: a directed graph G = (V, E), determine a simple cycle that contains each vertex in V – l Each vertex can only be visited once Certificate: – hamiltonian Sequence: v 1, v 2, v 3, …, v|V| not hamiltonian 22

Is P = NP? P l Any problem in P is also in NP: NP P NP l The big (and open question) is whether NP P or P = NP – i. e. , if it is always easy to check a solution, should it also be easy to find a solution? l Most computer scientists believe that this is false but we do not have a proof … 23

NP-Completeness (informally) P l NP-complete problems are NP defined as the hardest problems in NP l Most practical problems turn out to be either P or NPcomplete. l 24 Study NP-complete problems …

Summary l Decision problems – l Optimization problems – l l l 25 l Given an input and a question regarding a problem, determine if the answer is yes or no Find a solution with the “best” value NP-complete - means problems that are 'complete' in NP, i. e. the most difficult to solve in NP NP-hard - stands for 'at least' as hard as NP (but not necessarily in NP); NP-easy - stands for 'at most' as hard as NP (but not necessarily in NP); NP-equivalent - means equally difficult as NP, (but not necessarily in NP);

In next Lecture l 26 In next lecture, we will revised the first fifteen lectures.