Function Problems and Syntactic Subclasses of TFNP
|
|
- Collin Warren
- 6 years ago
- Views:
Transcription
1 Function Problems and Syntactic Subclasses of TFNP N. Elgers Abstract Function problems are an extension of decision problems in the sense that they require a more extensive answer than yes or no. FP, FNP and TFNP are wellknown classes of function problems. The former two are similarly defined to their decision equivalents P and NP. TFNP, however, does not originate from a decision equivalent. In addition, it has the unsatisfying property that it is a semantic class. In this work the above-mentioned classes are briefly discussed after which three syntactic subclasses of TFNP are investigated. 1 Function Problems Decision problems require a yes or no answer. Consider the following examples: Does the given graph have a Hamiltonian cycle? Is the given number composite? Does the given graph have a k-coloring? In practice, however, it might be useful to compute an actual solution to the problem if the answer is yes. Consider following examples: What is a Hamiltonian cycle of the given graph, if any? What is the prime factorisation of the given number? What is a k-coloring of the given graph, if any? Both groups of examples are very similar but they differ in the fact that the latter group of questions, which can be called function problems, require a more extensive answer than yes or no. The name function is somewhat of a misnomer because function implies that for each input, there is exactly one output. This does not have to be the case. It is possible that for a given input a solution does not exist (e.g. no Hamiltonian cycle exists) or there are multiple solutions (e.g. multiple Hamiltonian cycles). 1
2 2 N. Elgers Function problems can be described by binary relations R(x,y) Σ Σ in which x Σ and y Σ are said to be the input (i.e. the question) and output (i.e. the answer/solution), respectively. In this work only polynomially bounded relations are considered. A binary relation R is polynomially bounded iff there is a k 0 such that for each pair (x,y) R it holds that y x k. 1.1 Function Polynomial (FP) Definition 1. A polynomially bounded binary relation R Σ Σ is in FP iff there is a deterministic polynomial-time Turing Machine that, given an input x Σ, computes a y Σ such that (x,y) R. Example 1. The polynomial-time many-one reduction, known as Karp reduction, is defined as follows: a language L Σ is said to be Karp reducible to another language L Σ if there is a polynomial-time computable function such that for every x Σ, x L if and only if f (x) L. Computing that function is an obvious problem in FP. A lot of simple mathematical operators are known to be in FP: addition, subtraction, division, greatest common divider (gcd) and more. The definition of FP implies there is always an answer for any input. What happens, though, when the operator is undefined on the input? Take for example division by zero. We can map this input to a string that represents an invalid result. When we encounter this output, we can easily decide that the answer is undefined. 1.2 Function Non deterministic Polynomial (FNP) Definition 2. A polynomially bounded binary relation R Σ Σ is in FNP iff there is a deterministic polynomial-time Turing Machine that, given a pair (x,y) Σ Σ, decides if (x,y) R. Example 2. The function satisfiability problem (FSAT) asks to find a satisfying assignment of a given boolean proposition, if it exists. Since SAT NP, there exists a deterministic polynomial-time Turing Machine that checks if y (an assignment) satisfies x (a SAT instance). Therefore, FSAT is naturally in FNP.
3 Function Problems and Syntactic Subclasses of TFNP 3 The definition above uses the notion of a verifier to define FNP. However it is possible to define it by using non-deterministic polynomial-time Turing Machines as well, as follows: Definition 3. A polynomially bounded binary relation R Σ Σ is in FNP iff there is a non-deterministic polynomial-time Turing Machine that for a given input x Σ for which there exists a y Σ such that (x,y) R, computes that y. From this definition it is clear, if not from definition 2 already, that FP FNP. In addition, it is easy to see that FP = FNP iff P = NP. Note that these definitions do not imply, in contrast to FP, that there must be a (polonomially-bounded) y for every x so that R(x, y) holds. The question arises if it is possible to map undefined inputs to an output that represent an invalid solution as is the case for FP. The answer is no. For FNP, it is believed to not be efficiently decidable (i.e. in deterministic polynomial time) that an input has no solution. Thus, it is not possible to map undefined inputs to outputs that represent a non-existing solution. In fact, if that turns out to be case anyway then NP = conp. 1.3 Total Function Non deterministic Polynomial (FNP) Definition 4. A polynomially bounded binary relation R Σ Σ is in TFNP iff there is a deterministic polynomial-time Turing Machine that, given a pair (x,y) Σ Σ, decides if (x,y) R. In addition, there must be at least one y for each x such that R(x,y) holds. Example 3. FACTORING is the problem of decomposing an integer N into its prime decomposition N = p k 1 1 pk pk m m. Every strictly positive integer has a prime decomposition, so the problem is clearly in TFNP. It is not known if this problem is in FP as well. It is obvious that FP TFNP FNP. TFNP is a semantic class. This means that it is not known if it can be efficiently checked that a given Turing Machine decides a relation in TFNP. More intuitively, suppose someone were to present a description of a Turing Machine claiming it defines a relation in TFNP and someone else would like to check this property. An intuitive, naïve way to do this is to check that every possible input results in a valid answer. Which is not an efficient method. For semantic classes, it is not known if
4 4 N. Elgers there exists an efficient method. An additional property of semantic classes is that they are likely not to have any complete problems. Classes for which it holds that it is easily verifiable that a machine decides a relation/language in the class are said to be syntactic classes. These classes are sure to have a complete problem. 2 Syntactic subclasses of TFNP Since syntacticness is a nice property to have, it is useful to define/investigate subclasses of TFNP other than FP. In this section the classes PPP, PPA, PPAD and PLS are studied. These are syntactic subclasses of TFNP that have been defined and investigated by Christos H. Papadimitriou. 2.1 Polynomial Pigeonhole Principle (PPP) The pigeonhole principle is a very well known statement saying that if there are n items are to be put in m containers, with n > m > 0, then at least one container must contain more than one item. PIGEONHOLE CIRCUIT is the following computational problem. Given a boolean circuit C in which the length n of the input and the output are the same, find a x Σ n such that C(x) = 0 or find two x,x Σ n with x x such that C(x) = C(x ). Definition 5. A polynomially bounded relation R Σ Σ is in PPP iff there is a polynomial time reduction from R to PIGEONHOLE CIRCUIT. It holds that PPP TFNP because the defining problem always ensures an answer on any input. Note that it is proven by the pigeonhole principle that problems in PPP are always total, thus PPP is syntactic. PIGEONHOLE CIRCUIT is complete for PPP, by definition. Example 4. EQUAL SUMS is the following computational problem. Given an input that consists of a set of n positive integers that add up to less than 2 n 1, find two distinct subsets so the sum of the numbers in each subset is equal. Theorem 1. EQUAL SUMS is in PPP Proof. It will be shown that EQUAL SUMS always has a solution using the pigeonhole principle. First assume, without loss of generality, that all numbers in the input are distinct. In a set of n (distinct) numbers, there are 2 n different subsets. The lowest subset sum is 0 (empty set) and the largest is 2 n 2. In other words, there are
5 Function Problems and Syntactic Subclasses of TFNP 5 2 n 1 subsets with the same sums. By the pigeonhole principle, there must be at least two different subsets with the same sum. Let these subsets be A and B. Then A \ (A B) and B \ (A B) are two distinct subsets with the same subset sum. It is not known if EQUAL SUMS is complete for PPP. Worse still, PIGEONHOLE CIRCUIT is the only problem that is known to be complete for PPP. Although this makes the class sound disappointing, there is an interesting statement that involves PPP and concerns cryptography. Proposition 1. If PPP = FP, then one-way permutations do not exist [4]. Proof. Suppose that PIGEONHOLE CIRCUIT is in FP. Then it is possible to invert the alleged one-way length-preserving polynomially computable permutation π by the following procedure. Given x, in order to find a y such that π(y) = x, turn algorithm for π into a circuit and add an exclusive-or of the output with the bitstring x. Afterwards apply to the resulting circuit C the assumed polynomial algorithm for PIGEONHOLE CIRCUIT. Since π is a permutation, the algorithm can not return two inputs with the same output, so it must return a y such that C(y) = 0; that is, π(y) = x. Fig. 1 Pigeonhole Principle. In a dovecot with 9 pigeonholes where 10 pigeons live, there must be at least 1 compartment with more than one pigeon in it. 2.2 Polynomial Parity Argument (PPA) Consider a deterministic polynomial-time Turing Machine M. Let x Σ be an input for M. The configuration space C(x) is Σ p( x ) with p a polynomial. Given a configuration c C(x), M outputs in time O(p( c )) a set M(x,c) of at most two configurations. An unordered pair of configurations [c,c ] are said to be neighbours, denoted [c,c ] G(x), iff c M(x,c ) and c M(x,c). G(x) is essentialy a graph of
6 6 N. Elgers degree at most two. In addition, M is such that M(x,0 0) = {1 1} and 0 0 M(x,1 1). It is said that M embodies the even leaves argument, a graph theoretic lemma: Lemma 1. Every graph of degree two or less has an even number of leaves. A leaf in a graph is a vertex of degree one. Definition 6. A polynomially bounded binary relation R Σ Σ is in PPA iff there is a deterministic polynomial-time Turing Machine that embodies the even leaves argument and for each x Σ and its configuration graph G(x) it holds that (x,y) R iff y is a leaf of G(x) other than 0 0. Example 5. 3SMITH is the following problem in PPA: given a 3-regular graph G and a Hamiltionian cycle C of G, find an other Hamiltonian cycle. Such a second cycle is sure to exist due to Smith s theorem which states that every odd-degree graph has an even number of Hamiltonian cycles [7]. An algorithm to solve this problem is the following: delete an edge from the given cycle and fix an endpoint, denoted by x, of the resulting path. Denote the other endpoint by y. Execute the unique rotation from y. The resulting path has two possible rotations from y. One that undoes the previous rotation and an other. Iteratively apply the latter rotation. Cycles in this process are not possible since otherwise new rotations would not be unique, which is the case for 3-regular graphs. Therefore, unavoidably, the algorithm will encounter a path in which y only has the undo rotation. This is the case when x and y can be reconnected by an edge. At this point, the algorithm terminates and reports the new found Hamiltonian cycle. It is clear that this algorithm embodies the Turing Machine M from the PPA definition. M is used to compute the possible rotations. An example execution is shown in Fig. 2. It is not known if SMITH is complete for PPA A graph theoretic lemma is used to show that problems in PPA are total. Thus, PPA is syntactic. Note that an iteration can be executed in polynomial time but the amount of iterations required is not necessarily polynomially bounded.
7 Function Problems and Syntactic Subclasses of TFNP 7 Fig. 2 3SMITH is in PPA In an attempt to generalize PPA, assume that the following alteration is applied to its definition. Instead of restricting M(x,c) to be at most two, let it be polynomially bounded by x. As a consequence, G(x) its degree will be polynomially bounded as well. The problem now asks for any odd-degree node. This generalised definition invokes another graph theoretic lemma: Lemma 2 (The Polynomial Parity Argument). A finite graph has an even number of odd-degree nodes. Denote the resulting class by PPA. The following theorem states that this definition is not fundamentally different. Theorem 2. PPA = PPA Proof. It is obvious that PPA PPA. It can be shown that each problem in PPA that embodies the configuration machine M, that machine M can be altered in polynomial time to present a problem in PPA. Consider such configuration machine M for a problem in PPA. For each vertex c of G(x) its neighbourhood N(c) can be computed. If N(x) = k 1, new vertices (c,i);i = 1,..., k/2 are created. The two neighbours of (c,i) are the two nodes of the form (c, j), where the lexicograhically 2ith or (2i + 1)th edge out of c is [c,c ], which is also the 2 jth or (2 j + 1)th edge out of c. It is clear that the nonstandard leaves of the new graph coincide with the nonstandard odd-degree nodes of the former, and that the neighbours of each node of the new graph can be computed in polynomial time. In other words, replacing even leaves argument in the definition of PPA by polynomial parity argument does not change it. Most often it is the latter argument that is associated with PPA. Because of this result it is easy to see that the generalised problem of 3SMITH denoted by SMITH, which concerns any odd-degree graph, is in PPA as well.
8 8 N. Elgers In 2001, over half a decade after Papadimitriou s definition of PPA, it has been shown that a very specific restriction of SPERNER is PPA-complete [2]. As of currently, there are no other problems known to be complete for PPA. 2.3 Polynomial Parity Argument for Directed graphs (PPAD) In this section PPAD is introduced. Proofs that problems are in PPAD and/or complete for PPAD are lengthy and hard to understand. Therefore, the problems are mentioned but for their proofs of their PPAD membership/completeness the literature is referenced. PPAD has the same definition as PPA, except that the configuration graph G(x) is defined differently. Consider, without loss of generalisation, the even leaves argument definition of PPA. G(x) is now allowed to be directed. The ordered pair of nodes (c,c ) G(x) iff c is the second component of M(x,c) and c is the first component of M(x,c ). The problem is to find any node (other than the standard source 0 0) with indegree + outdegree = 1. In other words, a correct output is any source or sink of the directed graph other than the standard source. The definition, equivalently to PPA, can be generalised so that a vertex has a polynomial amount of neighbours and can be proven to be equivalent to the original definition. In this generalised definition, a solution is a vertex where indegree + outdegree is odd. Example 6. 2D-SPERNER. Consider an arbitrary triangulation of a triangle ABC (the 2D simplex). Colour the resulting vertices S as follows. Colour A, B and C with 1, 2 and 3 respectively. The vertices on a edge of the original triangle may only be coloured with a colour that is on the either end point of that edge. The remaining vertices may have any colour. Sperner s lemma states that there exists a triangle in the triangulation that has all three colours [8]. More precisely, there are an odd number of them. In Fig. 3 such coloured triangulation is shown. The triangles in grey are trichromatic. This problem is referenced to as 2D-SPERNER. The generalised problem, kd-sperner, concerns multidimensional simplices. Corollary 1. PPAD PPA TFNP FNP Proof. It should be clear that PPAD PPA from PPAD s definition. PPA TFNP as explained in the previous section. Corollary 2. PPAD PPP TFNP FNP Proof. The only thing to proof here is PPAD PPP. It can be shown that any problem in PPAD with configuration graph G can be reformulated as a problem in PPP. Create a circuit C so that C(x) is equal to: x itself if x is a sink in G; (b) G 2 (x) if x is a nonstandard source; (c) G(x) otherwise. It is easy to see that from any confluence of values of π a nonstandard source or sink of G can be recovered.
9 Function Problems and Syntactic Subclasses of TFNP 9 Theorem 3. For any k 2, kd-sperner is in PPAD. Proof. See [4]. Fig. 3 Sperner s lemma Example 7. BROUWER is the following computational problem. Given a continuous function f mapping a compact convex set X into itself, find a x X such that f (x) = x. Such x is sure to exist due to Brouwer s fixed-point theorem [1]. Theorem 4. BROUWER is PPAD-complete. Proof. See [4]. Example 8. NASH is the following problem. Given a finite game G, find a Mixed Nash Equilibrium (MNE) G. Such a MNE is sure to exist due to John F. Nash Jr. his famous proof from his disseration.[3, 8] Theorem 5. NASH is PPAD-complete. Proof. Although in a very non-straightforward way, BROUWER polynomially reduces to NASH which is in PPAD. See [4]. The field of Game Theory is a field that is thoroughly being studied by economists. The concept of MNE is used intensively by them. Therefore, NASH is a problem for which efficient (approximation) algorithms are wanted. This piques the interest of computer scientists.
10 10 N. Elgers 2.4 Polynomial Local Search (PLS) This complexity class captions the notion of polynomial local search algorithms. These are algorithms that are used for a lot of problems in which a locally optimal solution is wanted and/or sufficient. Similarly to PPAD, proofs that problems are PLS-complete are lengthy so they are only referenced to. Definition 7. A binary relation R Σ Σ is in PLS iff there is a deterministic polynomial-time Turing Machine for each of the following problems: A R : Given x Σ, compute some s F R (x) Σ. B R : Given (s,x) F R (x) Σ, compute the cost c R (s,x) N of s for x. C R : Given (s,x) F R (x) Σ, compute a s η R (s,x) F R (x) such that c R (s,x) < c R (s,x). If no such s exists, report that (x,s) R. F R (x) is often referred to as the solution set of instance x. s F R (x) does not imply that (x,s) R, s merely serves as an intermediate solution. c R (s,x) is the cost of solution s for instance x. η R (s,x) is the neighbourhood of intermediate solution s for instance x. This definition implies a very straightforward algorithm. 1. s = A R (x). 2. s = C R (s,x). If C R reported that (x,s) R, report s. Else, repeat this step. The algorithm computes a solution that is locally optimal (i.e. the best in its neighbourhood). The hardness of a problem in PLS arises from the fact that the number of iterations of a local search algorithm may be exponential. This notion of computing locally optimal solutions is intensively studied in literature for many different problems. Example 9. FLIP is the following problem. Given a circuit with many inputs and outputs, find an input whose output (viewed as a binary integer) cannot be reduced by flipping any single bit of the input. Theorem 6. FLIP is PLS-complete. Proof. See [4]. Corollary 3. FP PLS TFNP FNP Proof. The only thing to proof here that has not been proved in a previous section is that PLS TFNP, although this is a very straightforward statement. At the start of a local search algorithm (i.e. the set of the three algorithms A,B and C), the initialisation algorithm A computes an initial solution. A solution for any possible input is hereby already existant although it will probably improved upon by the rest of the algorithm.
11 Function Problems and Syntactic Subclasses of TFNP 11 The proof statement is (more formally) backed up by following graph theoretic lemma: Lemma 3. Every directed acyclic graph (dag) has a sink. For any instance x of a PLS problem R, it is possible to construct the following graph. Let every (intermediate) solution, i.e. the set F R (x), be a vertex of the graph. Create a directed edge from a solution s to another s iff s is in the neighbourhood of s and c R (s,x) < c R (s,x), i.e. a directed edge to all the possible outcomes an algorithm C R (s,x) could have. This constructs a directed acyclic graph. By the lemma, this graph has a sink. The PLS algorithm described above will halt in this sink and thus this sink presents a local optimum. This reinforces the claim that PLS TFNP. References 1. L.E.J. Brouwer. ber abbildung von mannigfaltigkeiten. Mathematische Annalen, 71:97 115, Michelangelo Grigni. A sperner lemma complete for ppa. Information Processing Letters, 77(5): , John F. Nash. A dissertation on non-cooperative game theory. Princeton university, Christos H. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 48(3): , Christos H Papadimitriou. Computational complexity. John Wiley and Sons Ltd., Elaine Rich. Automata, computability and complexity: theory and applications. Pearson Prentice Hall Upper Saddle River, A.G. Thomason. Hamiltonian cycles and uniquely edge colourable graphs. Annals of Discrete Mathematics, 3: , Albert Xin and Jiang Kevin Leyton-brown. A tutorial on the proof of the existence of nash equilibria.
NP and conp. Theorem. Skoulakis Stratis NP,coNP and Funtion Problems EuroCG 14, Ein-Gedi, Israel 1 / 18
NP and conp Theorem Let L NP then there exists a polynomial decidable and balanced relation R L such that for all string x L: there exists a string y such that R L (x, y) if and only if x L. Skoulakis
More informationTotal NP Functions I: Complexity and Reducibility
Total NP Functions I: Complexity and Reducibility (UCSD) sbuss@math.ucsd.edu Newton Institute, March 2012 Total NP Functions [Meggido-Papadimitriou 91, Papadimitriou 94]. Definition, the class of Total
More informationGame Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems
Game Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems March 17, 2011 Summary: The ultimate goal of this lecture is to finally prove Nash s theorem. First, we introduce and prove Sperner s
More informationThe Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard
Electronic Colloquium on Computational Complexity, Report No. 120 (2018) The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard Alexandros Hollender 1
More informationTopics of Algorithmic Game Theory
COMP323 Introduction to Computational Game Theory Topics of Algorithmic Game Theory Paul G. Spirakis Department of Computer Science University of Liverpool Paul G. Spirakis (U. Liverpool) Topics of Algorithmic
More informationAlgorithmic Game Theory
Nash Equilibria in Zero-Sum Games Algorithmic Game Theory Algorithmic game theory is not satisfied with merely an existence result for an important solution concept such as Nash equilibrium in mixed strategies.
More informationAn Introduction to Proof Complexity, Part II.
An Introduction to Proof Complexity, Part II. Pavel Pudlák Mathematical Institute, Academy of Sciences, Prague and Charles University, Prague Computability in Europe 2009, Heidelberg 2 Overview Part I.
More informationNP-Completeness. Until now we have been designing algorithms for specific problems
NP-Completeness 1 Introduction Until now we have been designing algorithms for specific problems We have seen running times O(log n), O(n), O(n log n), O(n 2 ), O(n 3 )... We have also discussed lower
More informationMore Completeness, conp, FNP,etc. CS254 Chris Pollett Oct 30, 2006.
More Completeness, conp, FNP,etc. CS254 Chris Pollett Oct 30, 2006. Outline A last complete problem for NP conp, conp NP Function problems MAX-CUT A cut in a graph G=(V,E) is a set of nodes S used to partition
More informationI. Introduction to NP Functions and Local Search
I. Introduction to NP Functions and Local Search (UCSD) sbuss@math.ucsd.edu Prague, September 2009 NP Functions TFNP [JPY 88, Papadimitriou 94]. Definition TFNP, the class of Total NP Functions is the
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationLecture 9 : PPAD and the Complexity of Equilibrium Computation. 1 Complexity Class PPAD. 1.1 What does PPAD mean?
CS 599: Algorithmic Game Theory October 20, 2010 Lecture 9 : PPAD and the Complexity of Equilibrium Computation Prof. Xi Chen Scribes: Cheng Lu and Sasank Vijayan 1 Complexity Class PPAD 1.1 What does
More informationEssential facts about NP-completeness:
CMPSCI611: NP Completeness Lecture 17 Essential facts about NP-completeness: Any NP-complete problem can be solved by a simple, but exponentially slow algorithm. We don t have polynomial-time solutions
More informationconp = { L L NP } (1) This problem is essentially the same as SAT because a formula is not satisfiable if and only if its negation is a tautology.
1 conp and good characterizations In these lecture notes we discuss a complexity class called conp and its relationship to P and NP. This discussion will lead to an interesting notion of good characterizations
More informationLecture Notes Each circuit agrees with M on inputs of length equal to its index, i.e. n, x {0, 1} n, C n (x) = M(x).
CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 4 February 3, 2010 Scribe: Jonathan Pines 1 Agenda P-/NP- Completeness NP-intermediate problems NP vs. co-np L, NL 2 Recap Last time, we
More informationLecture 2. 1 More N P-Compete Languages. Notes on Complexity Theory: Fall 2005 Last updated: September, Jonathan Katz
Notes on Complexity Theory: Fall 2005 Last updated: September, 2005 Jonathan Katz Lecture 2 1 More N P-Compete Languages It will be nice to find more natural N P-complete languages. To that end, we ine
More informationAbstract Papadimitriou introduced several classes of NP search problems based on combinatorial principles which guarantee the existence of solutions t
The Relative Complexity of NP Search Problems Paul Beame 3 Computer Science and Engineering University of Washington Box 352350 Seattle, WA 98195-2350 beame@cs.washington.edu Stephen Cook y Computer Science
More informationA An Overview of Complexity Theory for the Algorithm Designer
A An Overview of Complexity Theory for the Algorithm Designer A.1 Certificates and the class NP A decision problem is one whose answer is either yes or no. Two examples are: SAT: Given a Boolean formula
More informationChapter 2 : Time complexity
Dr. Abhijit Das, Chapter 2 : Time complexity In this chapter we study some basic results on the time complexities of computational problems. concentrate our attention mostly on polynomial time complexities,
More informationNotes on Computer Theory Last updated: November, Circuits
Notes on Computer Theory Last updated: November, 2015 Circuits Notes by Jonathan Katz, lightly edited by Dov Gordon. 1 Circuits Boolean circuits offer an alternate model of computation: a non-uniform one
More informationIntro to Theory of Computation
Intro to Theory of Computation LECTURE 25 Last time Class NP Today Polynomial-time reductions Adam Smith; Sofya Raskhodnikova 4/18/2016 L25.1 The classes P and NP P is the class of languages decidable
More informationAbout the relationship between formal logic and complexity classes
About the relationship between formal logic and complexity classes Working paper Comments welcome; my email: armandobcm@yahoo.com Armando B. Matos October 20, 2013 1 Introduction We analyze a particular
More informationLecture 59 : Instance Compression and Succinct PCP s for NP
IITM-CS6840: Advanced Complexity Theory March 31, 2012 Lecture 59 : Instance Compression and Succinct PCP s for NP Lecturer: Sivaramakrishnan N.R. Scribe: Prashant Vasudevan 1 Introduction Classical Complexity
More informationCOP 4531 Complexity & Analysis of Data Structures & Algorithms
COP 4531 Complexity & Analysis of Data Structures & Algorithms Lecture 18 Reductions and NP-completeness Thanks to Kevin Wayne and the text authors who contributed to these slides Classify Problems According
More informationOn the Complexity of the Parity Argument and Other Inefficient Proofs of Existence
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 48, 498-532 (1994) On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence CHRISTOS H. PAPADIMITRIOU* Department of Computer Science and
More informationSymmetries and the Complexity of Pure Nash Equilibrium
Symmetries and the Complexity of Pure Nash Equilibrium Felix Brandt a Felix Fischer a, Markus Holzer b a Institut für Informatik, Universität München, Oettingenstr. 67, 80538 München, Germany b Institut
More informationLecture 17. In this lecture, we will continue our discussion on randomization.
ITCS:CCT09 : Computational Complexity Theory May 11, 2009 Lecturer: Jayalal Sarma M.N. Lecture 17 Scribe: Hao Song In this lecture, we will continue our discussion on randomization. 1 BPP and the Polynomial
More informationNotes on Complexity Theory Last updated: December, Lecture 2
Notes on Complexity Theory Last updated: December, 2011 Jonathan Katz Lecture 2 1 Review The running time of a Turing machine M on input x is the number of steps M takes before it halts. Machine M is said
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: NP-Completeness I Date: 11/13/18
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: NP-Completeness I Date: 11/13/18 20.1 Introduction Definition 20.1.1 We say that an algorithm runs in polynomial time if its running
More informationJASS 06 Report Summary. Circuit Complexity. Konstantin S. Ushakov. May 14, 2006
JASS 06 Report Summary Circuit Complexity Konstantin S. Ushakov May 14, 2006 Abstract Computer science deals with many computational models. In real life we have normal computers that are constructed using,
More informationComplexity. Complexity Theory Lecture 3. Decidability and Complexity. Complexity Classes
Complexity Theory 1 Complexity Theory 2 Complexity Theory Lecture 3 Complexity For any function f : IN IN, we say that a language L is in TIME(f(n)) if there is a machine M = (Q, Σ, s, δ), such that: L
More informationITCS:CCT09 : Computational Complexity Theory Apr 8, Lecture 7
ITCS:CCT09 : Computational Complexity Theory Apr 8, 2009 Lecturer: Jayalal Sarma M.N. Lecture 7 Scribe: Shiteng Chen In this lecture, we will discuss one of the basic concepts in complexity theory; namely
More informationCSC 5170: Theory of Computational Complexity Lecture 9 The Chinese University of Hong Kong 15 March 2010
CSC 5170: Theory of Computational Complexity Lecture 9 The Chinese University of Hong Kong 15 March 2010 We now embark on a study of computational classes that are more general than NP. As these classes
More informationLecture 6: Oracle TMs, Diagonalization Limits, Space Complexity
CSE 531: Computational Complexity I Winter 2016 Lecture 6: Oracle TMs, Diagonalization Limits, Space Complexity January 22, 2016 Lecturer: Paul Beame Scribe: Paul Beame Diagonalization enabled us to separate
More informationNP and Computational Intractability
NP and Computational Intractability 1 Review Basic reduction strategies. Simple equivalence: INDEPENDENT-SET P VERTEX-COVER. Special case to general case: VERTEX-COVER P SET-COVER. Encoding with gadgets:
More informationOn the Computational Hardness of Graph Coloring
On the Computational Hardness of Graph Coloring Steven Rutherford June 3, 2011 Contents 1 Introduction 2 2 Turing Machine 2 3 Complexity Classes 3 4 Polynomial Time (P) 4 4.1 COLORED-GRAPH...........................
More informationan efficient procedure for the decision problem. We illustrate this phenomenon for the Satisfiability problem.
1 More on NP In this set of lecture notes, we examine the class NP in more detail. We give a characterization of NP which justifies the guess and verify paradigm, and study the complexity of solving search
More informationPolynomial-time Reductions
Polynomial-time Reductions Disclaimer: Many denitions in these slides should be taken as the intuitive meaning, as the precise meaning of some of the terms are hard to pin down without introducing the
More informationLecture December 2009 Fall 2009 Scribe: R. Ring In this lecture we will talk about
0368.4170: Cryptography and Game Theory Ran Canetti and Alon Rosen Lecture 7 02 December 2009 Fall 2009 Scribe: R. Ring In this lecture we will talk about Two-Player zero-sum games (min-max theorem) Mixed
More information1 Circuit Complexity. CS 6743 Lecture 15 1 Fall Definitions
CS 6743 Lecture 15 1 Fall 2007 1 Circuit Complexity 1.1 Definitions A Boolean circuit C on n inputs x 1,..., x n is a directed acyclic graph (DAG) with n nodes of in-degree 0 (the inputs x 1,..., x n ),
More informationBoolean circuits. Lecture Definitions
Lecture 20 Boolean circuits In this lecture we will discuss the Boolean circuit model of computation and its connection to the Turing machine model. Although the Boolean circuit model is fundamentally
More informationLimitations of Algorithm Power
Limitations of Algorithm Power Objectives We now move into the third and final major theme for this course. 1. Tools for analyzing algorithms. 2. Design strategies for designing algorithms. 3. Identifying
More informationUC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 22 Lecturer: David Wagner April 24, Notes 22 for CS 170
UC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 22 Lecturer: David Wagner April 24, 2003 Notes 22 for CS 170 1 NP-completeness of Circuit-SAT We will prove that the circuit satisfiability
More information6.891 Games, Decision, and Computation February 5, Lecture 2
6.891 Games, Decision, and Computation February 5, 2015 Lecture 2 Lecturer: Constantinos Daskalakis Scribe: Constantinos Daskalakis We formally define games and the solution concepts overviewed in Lecture
More informationComputer Science 385 Analysis of Algorithms Siena College Spring Topic Notes: Limitations of Algorithms
Computer Science 385 Analysis of Algorithms Siena College Spring 2011 Topic Notes: Limitations of Algorithms We conclude with a discussion of the limitations of the power of algorithms. That is, what kinds
More information1 Computational Problems
Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationThe Complexity of Computing a Nash Equilibrium
The Complexity of Computing a Nash Equilibrium Constantinos Daskalakis Paul W. Goldberg Christos H. Papadimitriou June 4, 2008 Abstract In 1951, John F. Nash proved that every game has a Nash equilibrium
More information1 Non-deterministic Turing Machine
1 Non-deterministic Turing Machine A nondeterministic Turing machine is a generalization of the standard TM for which every configuration may yield none, or one or more than one next configurations. In
More informationThe Complexity of Computing a Nash Equilibrium
The Complexity of Computing a Nash Equilibrium Constantinos Daskalakis Paul W. Goldberg Christos H. Papadimitriou April 23, 2008 Abstract In 1951, John F. Nash proved that every game has a Nash equilibrium
More informationChapter 2. Reductions and NP. 2.1 Reductions Continued The Satisfiability Problem (SAT) SAT 3SAT. CS 573: Algorithms, Fall 2013 August 29, 2013
Chapter 2 Reductions and NP CS 573: Algorithms, Fall 2013 August 29, 2013 2.1 Reductions Continued 2.1.1 The Satisfiability Problem SAT 2.1.1.1 Propositional Formulas Definition 2.1.1. Consider a set of
More informationComplexity Theory Part II
Complexity Theory Part II Time Complexity The time complexity of a TM M is a function denoting the worst-case number of steps M takes on any input of length n. By convention, n denotes the length of the
More informationAlgorithms Design & Analysis. Approximation Algorithm
Algorithms Design & Analysis Approximation Algorithm Recap External memory model Merge sort Distribution sort 2 Today s Topics Hard problem Approximation algorithms Metric traveling salesman problem A
More informationLecture 20: conp and Friends, Oracles in Complexity Theory
6.045 Lecture 20: conp and Friends, Oracles in Complexity Theory 1 Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode:
More informationLecture 4 : Quest for Structure in Counting Problems
CS6840: Advanced Complexity Theory Jan 10, 2012 Lecture 4 : Quest for Structure in Counting Problems Lecturer: Jayalal Sarma M.N. Scribe: Dinesh K. Theme: Between P and PSPACE. Lecture Plan:Counting problems
More informationNotes for Lecture Notes 2
Stanford University CS254: Computational Complexity Notes 2 Luca Trevisan January 11, 2012 Notes for Lecture Notes 2 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationCSE 200 Lecture Notes Turing machine vs. RAM machine vs. circuits
CSE 200 Lecture Notes Turing machine vs. RAM machine vs. circuits Chris Calabro January 13, 2016 1 RAM model There are many possible, roughly equivalent RAM models. Below we will define one in the fashion
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURES 30-31 NP-completeness Definition NP-completeness proof for CIRCUIT-SAT Adam Smith 11/3/10 A. Smith; based on slides by E. Demaine, C. Leiserson, S. Raskhodnikova,
More informationLecture 14 - P v.s. NP 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 27, 2018 Lecture 14 - P v.s. NP 1 In this lecture we start Unit 3 on NP-hardness and approximation
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 26 Computational Intractability Polynomial Time Reductions Sofya Raskhodnikova S. Raskhodnikova; based on slides by A. Smith and K. Wayne L26.1 What algorithms are
More informationDoes the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? Harry Buhrman 1, Lance Fortnow 2, Michal Koucký 3, John D. Rogers 4, and Nikolay Vereshchagin 5 1 CWI, Amsterdam, buhrman@cwi.nl
More informationChapter 5 The Witness Reduction Technique
Outline Chapter 5 The Technique Luke Dalessandro Rahul Krishna December 6, 2006 Outline Part I: Background Material Part II: Chapter 5 Outline of Part I 1 Notes On Our NP Computation Model NP Machines
More information1.1 P, NP, and NP-complete
CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Introduction to NP-complete Problems Date: 11/01/2008 Lecturer: Lap Chi Lau Scribe: Jerry Jilin Le This lecture gives a general introduction
More informationLecture 19: Finish NP-Completeness, conp and Friends
6.045 Lecture 19: Finish NP-Completeness, conp and Friends 1 Polynomial Time Reducibility f : Σ* Σ* is a polynomial time computable function if there is a poly-time Turing machine M that on every input
More information3 Nash is PPAD Complete
Electronic Colloquium on Computational Complexity, Report No. 134 (2005) 3 Nash is PPAD Complete Xi Chen Department of Computer Science Tsinghua University Beijing, P.R.China xichen00@mails.tsinghua.edu.cn
More informationA.Antonopoulos 18/1/2010
Class DP Basic orems 18/1/2010 Class DP Basic orems 1 Class DP 2 Basic orems Class DP Basic orems TSP Versions 1 TSP (D) 2 EXACT TSP 3 TSP COST 4 TSP (1) P (2) P (3) P (4) DP Class Class DP Basic orems
More informationTuring Machines, diagonalization, the halting problem, reducibility
Notes on Computer Theory Last updated: September, 015 Turing Machines, diagonalization, the halting problem, reducibility 1 Turing Machines A Turing machine is a state machine, similar to the ones we have
More informationLecture 4: NP and computational intractability
Chapter 4 Lecture 4: NP and computational intractability Listen to: Find the longest path, Daniel Barret What do we do today: polynomial time reduction NP, co-np and NP complete problems some examples
More informationIS VALIANT VAZIRANI S ISOLATION PROBABILITY IMPROVABLE? Holger Dell, Valentine Kabanets, Dieter van Melkebeek, and Osamu Watanabe December 31, 2012
IS VALIANT VAZIRANI S ISOLATION PROBABILITY IMPROVABLE? Holger Dell, Valentine Kabanets, Dieter van Melkebeek, and Osamu Watanabe December 31, 2012 Abstract. The Isolation Lemma of Valiant & Vazirani (1986)
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 14, 2014 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More informationFriday Four Square! Today at 4:15PM, Outside Gates
P and NP Friday Four Square! Today at 4:15PM, Outside Gates Recap from Last Time Regular Languages DCFLs CFLs Efficiently Decidable Languages R Undecidable Languages Time Complexity A step of a Turing
More informationP is the class of problems for which there are algorithms that solve the problem in time O(n k ) for some constant k.
Complexity Theory Problems are divided into complexity classes. Informally: So far in this course, almost all algorithms had polynomial running time, i.e., on inputs of size n, worst-case running time
More informationNotes for Lecture 21
U.C. Berkeley CS170: Intro to CS Theory Handout N21 Professor Luca Trevisan November 20, 2001 Notes for Lecture 21 1 Tractable and Intractable Problems So far, almost all of the problems that we have studied
More informationRandomness and non-uniformity
Randomness and non-uniformity JASS 2006 Course 1: Proofs and Computers Felix Weninger TU München April 2006 Outline Randomized computation 1 Randomized computation 2 Computation with advice Non-uniform
More informationComplete problems for classes in PH, The Polynomial-Time Hierarchy (PH) oracle is like a subroutine, or function in
Oracle Turing Machines Nondeterministic OTM defined in the same way (transition relation, rather than function) oracle is like a subroutine, or function in your favorite PL but each call counts as single
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 31 P and NP Self-reducibility NP-completeness Adam Smith 12/1/2008 S. Raskhodnikova; based on slides by K. Wayne Central ideas we ll cover Poly-time as feasible most
More information1 Computational problems
80240233: Computational Complexity Lecture 1 ITCS, Tsinghua Univesity, Fall 2007 9 October 2007 Instructor: Andrej Bogdanov Notes by: Andrej Bogdanov The aim of computational complexity theory is to study
More informationThe Relative Complexity of NP Search Problems
Journal of Computer and System Sciences 57, 319 (1998) Article o. SS981575 The Relative Complexity of P Search Problems Paul Beame* Computer Science and Engineering, University of Washington, Box 352350,
More informationNP-completeness. Chapter 34. Sergey Bereg
NP-completeness Chapter 34 Sergey Bereg Oct 2017 Examples Some problems admit polynomial time algorithms, i.e. O(n k ) running time where n is the input size. We will study a class of NP-complete problems
More information6.080 / Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationPolynomial-Time Reductions
Reductions 1 Polynomial-Time Reductions Classify Problems According to Computational Requirements Q. Which problems will we be able to solve in practice? A working definition. [von Neumann 1953, Godel
More informationCS 5114: Theory of Algorithms. Tractable Problems. Tractable Problems (cont) Decision Problems. Clifford A. Shaffer. Spring 2014
Department of Computer Science Virginia Tech Blacksburg, Virginia Copyright c 2014 by Clifford A. Shaffer : Theory of Algorithms Title page : Theory of Algorithms Clifford A. Shaffer Spring 2014 Clifford
More informationconp, Oracles, Space Complexity
conp, Oracles, Space Complexity 1 What s next? A few possibilities CS161 Design and Analysis of Algorithms CS254 Complexity Theory (next year) CS354 Topics in Circuit Complexity For your favorite course
More informationDRAFT. Algebraic computation models. Chapter 14
Chapter 14 Algebraic computation models Somewhat rough We think of numerical algorithms root-finding, gaussian elimination etc. as operating over R or C, even though the underlying representation of the
More informationMore on NP and Reductions
Indian Institute of Information Technology Design and Manufacturing, Kancheepuram Chennai 600 127, India An Autonomous Institute under MHRD, Govt of India http://www.iiitdm.ac.in COM 501 Advanced Data
More informationNP and NP-Completeness
0/2/206 Algorithms NP-Completeness 7- Algorithms NP-Completeness 7-2 Efficient Certification NP and NP-Completeness By a solution of a decision problem X we understand a certificate witnessing that an
More informationNP-Completeness. Algorithmique Fall semester 2011/12
NP-Completeness Algorithmique Fall semester 2011/12 1 What is an Algorithm? We haven t really answered this question in this course. Informally, an algorithm is a step-by-step procedure for computing a
More informationThe Polynomial Hierarchy
The Polynomial Hierarchy Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas Ahto.Buldas@ut.ee Motivation..synthesizing circuits is exceedingly difficulty. It is even
More informationfsat We next show that if sat P, then fsat has a polynomial-time algorithm. c 2010 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 425
fsat fsat is this function problem: Let φ(x 1, x 2,..., x n ) be a boolean expression. If φ is satisfiable, then return a satisfying truth assignment. Otherwise, return no. We next show that if sat P,
More informationColoring Vertices and Edges of a Path by Nonempty Subsets of a Set
Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp April 28, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct nonempty
More informationSAT, NP, NP-Completeness
CS 473: Algorithms, Spring 2018 SAT, NP, NP-Completeness Lecture 22 April 13, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 57 Part I Reductions Continued Ruta (UIUC)
More informationNP-COMPLETE PROBLEMS. 1. Characterizing NP. Proof
T-79.5103 / Autumn 2006 NP-complete problems 1 NP-COMPLETE PROBLEMS Characterizing NP Variants of satisfiability Graph-theoretic problems Coloring problems Sets and numbers Pseudopolynomial algorithms
More information20.1 2SAT. CS125 Lecture 20 Fall 2016
CS125 Lecture 20 Fall 2016 20.1 2SAT We show yet another possible way to solve the 2SAT problem. Recall that the input to 2SAT is a logical expression that is the conunction (AND) of a set of clauses,
More informationIn complexity theory, algorithms and problems are classified by the growth order of computation time as a function of instance size.
10 2.2. CLASSES OF COMPUTATIONAL COMPLEXITY An optimization problem is defined as a class of similar problems with different input parameters. Each individual case with fixed parameter values is called
More information6-1 Computational Complexity
6-1 Computational Complexity 6. Computational Complexity Computational models Turing Machines Time complexity Non-determinism, witnesses, and short proofs. Complexity classes: P, NP, conp Polynomial-time
More informationAdvanced topic: Space complexity
Advanced topic: Space complexity CSCI 3130 Formal Languages and Automata Theory Siu On CHAN Chinese University of Hong Kong Fall 2016 1/28 Review: time complexity We have looked at how long it takes to
More informationComputability and Complexity Theory: An Introduction
Computability and Complexity Theory: An Introduction meena@imsc.res.in http://www.imsc.res.in/ meena IMI-IISc, 20 July 2006 p. 1 Understanding Computation Kinds of questions we seek answers to: Is a given
More information1 PSPACE-Completeness
CS 6743 Lecture 14 1 Fall 2007 1 PSPACE-Completeness Recall the NP-complete problem SAT: Is a given Boolean formula φ(x 1,..., x n ) satisfiable? The same question can be stated equivalently as: Is the
More informationQ = Set of states, IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar
IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar Turing Machine A Turing machine is an abstract representation of a computing device. It consists of a read/write
More information