DOCSLIB.ORG

Complement Classes and the Polynomial Time Hierarchy

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Complement Classes and the Polynomial Time Hierarchy CSCI 1590 Intro to Computational Complexity Complement Classes and the Polynomial Time Hierarchy John E. Savage Brown University February 9, 2009 John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 1 / 17 1 Review of Space Complexity 2 Complements of Complexity Classes 3 coNP 4 Polynomial Time Hierarchy John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 2 / 17 Overview We introduce classes of language complements and define the polynomial time hierarchy. We show that all languages in this hierarchy are contained in PSPACE. We introduce TQBF (totally quantified Boolean formulas). Later we show that it is PSPACE-complete. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 3 / 17 Review: Space Complexity Classes Class Space By Note L Logarithmic DTM NL Logarithmic NDTM L ⊆ NL L2 Square Log DTM PSPACE Polynomial DTM NPSPACE Polynomial NTM PSPACE ⊆ NPSPACE John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 4 / 17 Review: Savitch's Theorem and Its Consequences Theorem (Savitch) reachability is in SPACE(log 2n), n = jV j. Construct an algorithm to compute PATH(a; b; 2k ). Corollary If r(n) proper, r(n) = Ω(log n), then NSPACE(r(n)) ⊆ SPACE(r 2(n)). Construct configuration graph for NDTM recognizing L in NSPACE(r(n)). Theorem PSPACE = NPSPACE. Proof Easy to show that PSPACE ⊆ NPSPACE. From Corollary to Savitch's theorem, NPSPACE ⊆ PSPACE from which the result follows. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 5 / 17 Important Complexity Classes Time classes: P, NP, EXPTIME, NEXPTIME Space classes: L, NL, L2, PSPACE, NPSPACE. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 6 / 17 Complements of Decision Problems sat Instance: Literals X = fx1; x1; x2; x2;:::; xn; xng, and clauses C = (c1; c2;:::; cm) where each clause ci is a subset of X . Answer: \Yes" if for some assignment of Booleans to variables in fx1; x2;:::; xng, at least one literal in each clause has value 1. Definition The complement of a decision problem L, denoted coL, is the set of \No" instances of a decision problem. Note ∗ ∗ coL 6= L¯ = Σ − L. In fact, L [ coL = WFL ⊂ Σ where WFL is the set of well-formed strings describing \Yes" and \No" instances. That is, coL = WFL − L. Can recognize in PTIME whether a string is in WFL. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 7 / 17 Complements of Complexity Classes Definition The complement of a complexity class is the set of complements of languages in the class. Example coNP is set of languages consisting of \No" instances of NP languages. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 8 / 17 Complements of Complexity Classes Theorem Let If C1 ⊆ C2, coC1 ⊆ coC2. If C1 = C2, coC1 = coC2 Proof. If coL 2 coC1, L 2 C1. Thus, L 2 C2. This implies that coL 2 coC2. Note: coC is very different from languages not in C. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 9 / 17 Complements of Important Classes P = coP For deterministic Turing Machines, flip accept and reject states. PSPACE = coPSPACE As with P and coP, PSPACE= coPSPACE NPSPACE= coNPSPACE By Savitch's theorem NPSPACE = PSPACE, so coNPSPACE = coPSPACE = PSPACE What about coNP? If P = NP, then since P = coP, NP = coNP. Thus, if we can show that NP 6= coNP, then P 6= NP. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 10 / 17 Closure under Complements of Nondeterministic Space Classes coSPACE(s(n)) ⊆ coNSPACE(s(n)) follows from previous theorem. Combining with Savitch's theorem, we have NSPACE(s(n)) ⊆ SPACE(s(n)2) ⊆ coNSPACE(s(n)2) If the space to recognize a set of languages is at least logarithmic, a stronger result is known: Theorem (Immerman-Scelepscenyi) If r(n) = Ω(log n) is proper, NSPACE(r(n)) = coNSPACE(r(n)) Proof See textbooks. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 11 / 17 coNP Theorem Let L be an NP-complete language. coL is coNP-complete. Proof ∗ ∗ 0 By definition, if L ⊆ Σ1 is in NP, coL ⊆ Σ2 is in coNP. Any language L in NP can be reduced to L using some polynomial time reduction, f (x). f also reduces L¯0 to L¯ in PTIME. By assumption the sets of instances of L0 and L, denoted WFL0 and WFL, respectively, are PTIME recognizable. It ∗ ∗ follows that there exists a PTIME computable function g :Σ1 7! Σ2 such 0 that x 2 coL , g(x) 2 coL obtained by rejecting strings not in WFL0 and applying f to those in WFL0 . Again, if NP 6= coNP, then P 6= NP. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 12 / 17 Languages in coNP The language BF is the set of Boolean formulas fb(x)g that can have value true, denoted 9u b(u). coBF is the set of Boolean formulas that cannot have value true, denoted :9u b(u) = 8u b¯(u) where b¯(u), the Boolean complement of u, is another boolean formula b0(u). Since sat is NP-complete, so is BF. coBF is coNP-complete. coBF, or tautology, is the set of formulas that are true for all assignments of values to its variables, denoted 8u b0(u). Because tautology (or coBF) is coNP-complete, if tautology is in P, then P = coNP. It is highly improbable that there is a PTIME algorithm to show that a Boolean formula is not satisfiable by any input. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 13 / 17 Polynomial Time Hierarchy A language is in NP(coNP) if and only if it can be reduced in polynomial time to a statement of the form 9x b(x)(8x b(x)) What about additional levels of alternation? For two alternations 8x1 9x2 b(x1; x2) 9x1 8x2 b(x1; x2) The sets of languages reducible to statements of this form are denoted p p Π2 = f8x1 9x2 b(x1; x2)g and Σ2 = f9x1 8x2 b(x1; x2)g respectively. More generally, we can consider any constant number of alternations, p p i, and denote these sets of languages Πi and Σi . Here Π (Σ) signals that the outermost operator is universal (existential) quantification. The subscript indicates the number of levels of quantification. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 14 / 17 The Polynomial Time Hierarchy Definition The Polynomial Hierarchy (PH) is defined as [ p PH = Σi i Just as it is believed that P 6= NP and coNP 6= NP, it is conjectured that all levels of PH are distinct. p p As with sat and tautology, notice that Πi = coΣi . p p p If for i,Πi = Σi , PH = Σi , meaning PH collapses at the ith level. E.g. if 8u3 9u2 8u1 b(u3; u2; u1) = 9u3 8u2 9u1 b(u3; u2; u1) then 9u4 8u3 9u2 8u1 b(u3; u2; u1) = 9u4 9u3 8u2 9u1 b(u3; u2; u1) 9u4;u3 8u2 9u1 b(u3; u2; u1) p p If P = NP,Π1 = Σ1 and PH = P. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 15 / 17 PH and PSPACE It is not hard to see that PH 2 PSPACE. A language L is PH-complete if L 2 PH and all languages in PH are ptime reducible to L. Theorem If there is a language that is PH-complete, the polynomial hierarchy p collapses, that is, for some i, PH ⊆ Σi . Proof. S p p To see why, since PH = i Σi there is some i such that L 2 Σi . Since L p is PH-complete, we can reduce every language in PH to it and to Σi . p Thus, PH ⊆ Σi . John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 16 / 17 More Alternations An instance of tqbf is a quantified boolean formula with an unbounded number of alternations. In otherwords, each variable can be quantified separately. Any language in PH can be reduced to tqbf. tqbf 2 PSPACE. Later, we show tqbf is PSPACE-complete, that is, all languages in PSPACEcan be reduced to tqbf in polynomial time. John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 9, 2009 17 / 17.
Load more

Recommended publications
  • CS601 DTIME and DSPACE Lecture 5 Time and Space Functions: T, S
    CS601 DTIME and DSPACE Lecture 5 Time and Space functions: t, s : N → N+ Definition 5.1 A set A ⊆ U is in DTIME[t(n)] iff there exists a deterministic, multi-tape TM, M, and a constant c, such that, 1. A = L(M) ≡ w ∈ U M(w)=1 , and 2. ∀w ∈ U, M(w) halts within c · t(|w|) steps. Definition 5.2 A set A ⊆ U is in DSPACE[s(n)] iff there exists a deterministic, multi-tape TM, M, and a constant c, such that, 1. A = L(M), and 2. ∀w ∈ U, M(w) uses at most c · s(|w|) work-tape cells. (Input tape is “read-only” and not counted as space used.) Example: PALINDROMES ∈ DTIME[n], DSPACE[n]. In fact, PALINDROMES ∈ DSPACE[log n]. [Exercise] 1 CS601 F(DTIME) and F(DSPACE) Lecture 5 Definition 5.3 f : U → U is in F (DTIME[t(n)]) iff there exists a deterministic, multi-tape TM, M, and a constant c, such that, 1. f = M(·); 2. ∀w ∈ U, M(w) halts within c · t(|w|) steps; 3. |f(w)|≤|w|O(1), i.e., f is polynomially bounded. Definition 5.4 f : U → U is in F (DSPACE[s(n)]) iff there exists a deterministic, multi-tape TM, M, and a constant c, such that, 1. f = M(·); 2. ∀w ∈ U, M(w) uses at most c · s(|w|) work-tape cells; 3. |f(w)|≤|w|O(1), i.e., f is polynomially bounded. (Input tape is “read-only”; Output tape is “write-only”.
    [Show full text]
  • Complexity Theory Lecture 9 Co-NP Co-NP-Complete
    Complexity Theory 1 Complexity Theory 2 co-NP Complexity Theory Lecture 9 As co-NP is the collection of complements of languages in NP, and P is closed under complementation, co-NP can also be characterised as the collection of languages of the form: ′ L = x y y <p( x ) R (x, y) { |∀ | | | | → } Anuj Dawar University of Cambridge Computer Laboratory NP – the collection of languages with succinct certificates of Easter Term 2010 membership. co-NP – the collection of languages with succinct certificates of http://www.cl.cam.ac.uk/teaching/0910/Complexity/ disqualification. Anuj Dawar May 14, 2010 Anuj Dawar May 14, 2010 Complexity Theory 3 Complexity Theory 4 NP co-NP co-NP-complete P VAL – the collection of Boolean expressions that are valid is co-NP-complete. Any language L that is the complement of an NP-complete language is co-NP-complete. Any of the situations is consistent with our present state of ¯ knowledge: Any reduction of a language L1 to L2 is also a reduction of L1–the complement of L1–to L¯2–the complement of L2. P = NP = co-NP • There is an easy reduction from the complement of SAT to VAL, P = NP co-NP = NP = co-NP • ∩ namely the map that takes an expression to its negation. P = NP co-NP = NP = co-NP • ∩ VAL P P = NP = co-NP ∈ ⇒ P = NP co-NP = NP = co-NP • ∩ VAL NP NP = co-NP ∈ ⇒ Anuj Dawar May 14, 2010 Anuj Dawar May 14, 2010 Complexity Theory 5 Complexity Theory 6 Prime Numbers Primality Consider the decision problem PRIME: Another way of putting this is that Composite is in NP.
    [Show full text]
  • On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs*
    On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs* Benny Applebaum† Eyal Golombek* Abstract We study the randomness complexity of interactive proofs and zero-knowledge proofs. In particular, we ask whether it is possible to reduce the randomness complexity, R, of the verifier to be comparable with the number of bits, CV , that the verifier sends during the interaction. We show that such randomness sparsification is possible in several settings. Specifically, unconditional sparsification can be obtained in the non-uniform setting (where the verifier is modelled as a circuit), and in the uniform setting where the parties have access to a (reusable) common-random-string (CRS). We further show that constant-round uniform protocols can be sparsified without a CRS under a plausible worst-case complexity-theoretic assumption that was used previously in the context of derandomization. All the above sparsification results preserve statistical-zero knowledge provided that this property holds against a cheating verifier. We further show that randomness sparsification can be applied to honest-verifier statistical zero-knowledge (HVSZK) proofs at the expense of increasing the communica- tion from the prover by R−F bits, or, in the case of honest-verifier perfect zero-knowledge (HVPZK) by slowing down the simulation by a factor of 2R−F . Here F is a new measure of accessible bit complexity of an HVZK proof system that ranges from 0 to R, where a maximal grade of R is achieved when zero- knowledge holds against a “semi-malicious” verifier that maliciously selects its random tape and then plays honestly.
    [Show full text]
  • EXPSPACE-Hardness of Behavioural Equivalences of Succinct One
    EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets Petr Janˇcar1 Petr Osiˇcka1 Zdenˇek Sawa2 1Dept of Comp. Sci., Faculty of Science, Palack´yUniv. Olomouc, Czech Rep. [email protected], [email protected] 2Dept of Comp. Sci., FEI, Techn. Univ. Ostrava, Czech Rep. [email protected] Abstract We note that the remarkable EXPSPACE-hardness result in [G¨oller, Haase, Ouaknine, Worrell, ICALP 2010] ([GHOW10] for short) allows us to answer an open complexity ques- tion for simulation preorder of succinct one counter nets (i.e., one counter automata with no zero tests where counter increments and decrements are integers written in binary). This problem, as well as bisimulation equivalence, turn out to be EXPSPACE-complete. The technique of [GHOW10] was referred to by Hunter [RP 2015] for deriving EXPSPACE-hardness of reachability games on succinct one-counter nets. We first give a direct self-contained EXPSPACE-hardness proof for such reachability games (by adjust- ing a known PSPACE-hardness proof for emptiness of alternating finite automata with one-letter alphabet); then we reduce reachability games to (bi)simulation games by using a standard “defender-choice” technique. 1 Introduction arXiv:1801.01073v1 [cs.LO] 3 Jan 2018 We concentrate on our contribution, without giving a broader overview of the area here. A remarkable result by G¨oller, Haase, Ouaknine, Worrell [2] shows that model checking a fixed CTL formula on succinct one-counter automata (where counter increments and decre- ments are integers written in binary) is EXPSPACE-hard. Their proof is interesting and nontrivial, and uses two involved results from complexity theory.
    [Show full text]
  • Computational Complexity: a Modern Approach
    i Computational Complexity: A Modern Approach Draft of a book: Dated January 2007 Comments welcome! Sanjeev Arora and Boaz Barak Princeton University [email protected] Not to be reproduced or distributed without the authors’ permission This is an Internet draft. Some chapters are more finished than others. References and attributions are very preliminary and we apologize in advance for any omissions (but hope you will nevertheless point them out to us). Please send us bugs, typos, missing references or general comments to [email protected] — Thank You!! DRAFT ii DRAFT Chapter 9 Complexity of counting “It is an empirical fact that for many combinatorial problems the detection of the existence of a solution is easy, yet no computationally efficient method is known for counting their number.... for a variety of problems this phenomenon can be explained.” L. Valiant 1979 The class NP captures the difficulty of finding certificates. However, in many contexts, one is interested not just in a single certificate, but actually counting the number of certificates. This chapter studies #P, (pronounced “sharp p”), a complexity class that captures this notion. Counting problems arise in diverse fields, often in situations having to do with estimations of probability. Examples include statistical estimation, statistical physics, network design, and more. Counting problems are also studied in a field of mathematics called enumerative combinatorics, which tries to obtain closed-form mathematical expressions for counting problems. To give an example, in the 19th century Kirchoff showed how to count the number of spanning trees in a graph using a simple determinant computation. Results in this chapter will show that for many natural counting problems, such efficiently computable expressions are unlikely to exist.
    [Show full text]
  • Chapter 24 Conp, Self-Reductions
    Chapter 24 coNP, Self-Reductions CS 473: Fundamental Algorithms, Spring 2013 April 24, 2013 24.1 Complementation and Self-Reduction 24.2 Complementation 24.2.1 Recap 24.2.1.1 The class P (A) A language L (equivalently decision problem) is in the class P if there is a polynomial time algorithm A for deciding L; that is given a string x, A correctly decides if x 2 L and running time of A on x is polynomial in jxj, the length of x. 24.2.1.2 The class NP Two equivalent definitions: (A) Language L is in NP if there is a non-deterministic polynomial time algorithm A (Turing Machine) that decides L. (A) For x 2 L, A has some non-deterministic choice of moves that will make A accept x (B) For x 62 L, no choice of moves will make A accept x (B) L has an efficient certifier C(·; ·). (A) C is a polynomial time deterministic algorithm (B) For x 2 L there is a string y (proof) of length polynomial in jxj such that C(x; y) accepts (C) For x 62 L, no string y will make C(x; y) accept 1 24.2.1.3 Complementation Definition 24.2.1. Given a decision problem X, its complement X is the collection of all instances s such that s 62 L(X) Equivalently, in terms of languages: Definition 24.2.2. Given a language L over alphabet Σ, its complement L is the language Σ∗ n L. 24.2.1.4 Examples (A) PRIME = nfn j n is an integer and n is primeg o PRIME = n n is an integer and n is not a prime n o PRIME = COMPOSITE .
    [Show full text]
  • Succinctness of the Complement and Intersection of Regular Expressions Wouter Gelade, Frank Neven
    Succinctness of the Complement and Intersection of Regular Expressions Wouter Gelade, Frank Neven To cite this version: Wouter Gelade, Frank Neven. Succinctness of the Complement and Intersection of Regular Expres- sions. STACS 2008, Feb 2008, Bordeaux, France. pp.325-336. hal-00226864 HAL Id: hal-00226864 https://hal.archives-ouvertes.fr/hal-00226864 Submitted on 30 Jan 2008 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Symposium on Theoretical Aspects of Computer Science 2008 (Bordeaux), pp. 325-336 www.stacs-conf.org SUCCINCTNESS OF THE COMPLEMENT AND INTERSECTION OF REGULAR EXPRESSIONS WOUTER GELADE AND FRANK NEVEN Hasselt University and Transnational University of Limburg, School for Information Technology E-mail address: [email protected] Abstract. We study the succinctness of the complement and intersection of regular ex- pressions. In particular, we show that when constructing a regular expression defining the complement of a given regular expression, a double exponential size increase cannot be avoided. Similarly, when constructing a regular expression defining the intersection of a fixed and an arbitrary number of regular expressions, an exponential and double expo- nential size increase, respectively, can in worst-case not be avoided.
    [Show full text]
  • Lecture 9 1 Interactive Proof Systems/Protocols
    CS 282A/MATH 209A: Foundations of Cryptography Prof. Rafail Ostrovsky Lecture 9 Lecture date: March 7-9, 2005 Scribe: S. Bhattacharyya, R. Deak, P. Mirzadeh 1 Interactive Proof Systems/Protocols 1.1 Introduction The traditional mathematical notion of a proof is a simple passive protocol in which a prover P outputs a complete proof to a verifier V who decides on its validity. The interaction in this traditional sense is minimal and one-way, prover → verifier. The observation has been made that allowing the verifier to interact with the prover can have advantages, for example proving the assertion faster or proving more expressive languages. This extension allows for the idea of interactive proof systems (protocols). The general framework of the interactive proof system (protocol) involves a prover P with an exponential amount of time (computationally unbounded) and a verifier V with a polyno- mial amount of time. Both P and V exchange multiple messages (challenges and responses), usually dependent upon outcomes of fair coin tosses which they may or may not share. It is easy to see that since V is a poly-time machine (PPT), only a polynomial number of messages may be exchanged between the two. P ’s objective is to convince (prove to) the verifier the truth of an assertion, e.g., claimed knowledge of a proof that x ∈ L. V either accepts or rejects the interaction with the P . 1.2 Definition of Interactive Proof Systems An interactive proof system for a language L is a protocol PV for communication between a computationally unbounded (exponential time) machine P and a probabilistic poly-time (PPT) machine V such that the protocol satisfies the properties of completeness and sound- ness.
    [Show full text]
  • Sharp Lower Bounds for the Dimension of Linearizations of Matrix Polynomials∗
    Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 17, pp. 518-531, November 2008 ELA SHARP LOWER BOUNDS FOR THE DIMENSION OF LINEARIZATIONS OF MATRIX POLYNOMIALS∗ FERNANDO DE TERAN´ † AND FROILAN´ M. DOPICO‡ Abstract. A standard way of dealing with matrixpolynomial eigenvalue problems is to use linearizations. Byers, Mehrmann and Xu have recently defined and studied linearizations of dimen- sions smaller than the classical ones. In this paper, lower bounds are provided for the dimensions of linearizations and strong linearizations of a given m × n matrixpolynomial, and particular lineariza- tions are constructed for which these bounds are attained. It is also proven that strong linearizations of an n × n regular matrixpolynomial of degree must have dimension n × n. Key words. Matrixpolynomials, Matrixpencils, Linearizations, Dimension. AMS subject classifications. 15A18, 15A21, 15A22, 65F15. 1. Introduction. We will say that a matrix polynomial of degree ≥ 1 −1 P (λ)=λ A + λ A−1 + ···+ λA1 + A0, (1.1) m×n where A0,A1,...,A ∈ C and A =0,is regular if m = n and det P (λ)isnot identically zero as a polynomial in λ. We will say that P (λ)issingular otherwise. A linearization of P (λ)isamatrix pencil L(λ)=λX + Y such that there exist unimod- ular matrix polynomials, i.e., matrix polynomials with constant nonzero determinant, of appropriate dimensions, E(λ)andF (λ), such that P (λ) 0 E(λ)L(λ)F (λ)= , (1.2) 0 Is where Is denotes the s × s identity matrix. Classically s =( − 1) min{m, n}, but recently linearizations of smaller dimension have been considered [3].
    [Show full text]
  • The Polynomial Hierarchy
    ij 'I '""T', :J[_ ';(" THE POLYNOMIAL HIERARCHY Although the complexity classes we shall study now are in one sense byproducts of our definition of NP, they have a remarkable life of their own. 17.1 OPTIMIZATION PROBLEMS Optimization problems have not been classified in a satisfactory way within the theory of P and NP; it is these problems that motivate the immediate extensions of this theory beyond NP. Let us take the traveling salesman problem as our working example. In the problem TSP we are given the distance matrix of a set of cities; we want to find the shortest tour of the cities. We have studied the complexity of the TSP within the framework of P and NP only indirectly: We defined the decision version TSP (D), and proved it NP-complete (corollary to Theorem 9.7). For the purpose of understanding better the complexity of the traveling salesman problem, we now introduce two more variants. EXACT TSP: Given a distance matrix and an integer B, is the length of the shortest tour equal to B? Also, TSP COST: Given a distance matrix, compute the length of the shortest tour. The four variants can be ordered in "increasing complexity" as follows: TSP (D); EXACTTSP; TSP COST; TSP. Each problem in this progression can be reduced to the next. For the last three problems this is trivial; for the first two one has to notice that the reduction in 411 j ;1 17.1 Optimization Problems 413 I 412 Chapter 17: THE POLYNOMIALHIERARCHY the corollary to Theorem 9.7 proving that TSP (D) is NP-complete can be used with DP.
    [Show full text]
  • Complexity Theory
    Complexity Theory Course Notes Sebastiaan A. Terwijn Radboud University Nijmegen Department of Mathematics P.O. Box 9010 6500 GL Nijmegen the Netherlands [email protected] Copyright c 2010 by Sebastiaan A. Terwijn Version: December 2017 ii Contents 1 Introduction 1 1.1 Complexity theory . .1 1.2 Preliminaries . .1 1.3 Turing machines . .2 1.4 Big O and small o .........................3 1.5 Logic . .3 1.6 Number theory . .4 1.7 Exercises . .5 2 Basics 6 2.1 Time and space bounds . .6 2.2 Inclusions between classes . .7 2.3 Hierarchy theorems . .8 2.4 Central complexity classes . 10 2.5 Problems from logic, algebra, and graph theory . 11 2.6 The Immerman-Szelepcs´enyi Theorem . 12 2.7 Exercises . 14 3 Reductions and completeness 16 3.1 Many-one reductions . 16 3.2 NP-complete problems . 18 3.3 More decision problems from logic . 19 3.4 Completeness of Hamilton path and TSP . 22 3.5 Exercises . 24 4 Relativized computation and the polynomial hierarchy 27 4.1 Relativized computation . 27 4.2 The Polynomial Hierarchy . 28 4.3 Relativization . 31 4.4 Exercises . 32 iii 5 Diagonalization 34 5.1 The Halting Problem . 34 5.2 Intermediate sets . 34 5.3 Oracle separations . 36 5.4 Many-one versus Turing reductions . 38 5.5 Sparse sets . 38 5.6 The Gap Theorem . 40 5.7 The Speed-Up Theorem . 41 5.8 Exercises . 43 6 Randomized computation 45 6.1 Probabilistic classes . 45 6.2 More about BPP . 48 6.3 The classes RP and ZPP .
    [Show full text]
  • Delegating Computation: Interactive Proofs for Muggles∗
    Electronic Colloquium on Computational Complexity, Revision 1 of Report No. 108 (2017) Delegating Computation: Interactive Proofs for Muggles∗ Shafi Goldwasser Yael Tauman Kalai Guy N. Rothblum MIT and Weizmann Institute Microsoft Research Weizmann Institute [email protected] [email protected] [email protected] Abstract In this work we study interactive proofs for tractable languages. The (honest) prover should be efficient and run in polynomial time, or in other words a \muggle".1 The verifier should be super-efficient and run in nearly-linear time. These proof systems can be used for delegating computation: a server can run a computation for a client and interactively prove the correctness of the result. The client can verify the result's correctness in nearly-linear time (instead of running the entire computation itself). Previously, related questions were considered in the Holographic Proof setting by Babai, Fortnow, Levin and Szegedy, in the argument setting under computational assumptions by Kilian, and in the random oracle model by Micali. Our focus, however, is on the original inter- active proof model where no assumptions are made on the computational power or adaptiveness of dishonest provers. Our main technical theorem gives a public coin interactive proof for any language computable by a log-space uniform boolean circuit with depth d and input length n. The verifier runs in time n · poly(d; log(n)) and space O(log(n)), the communication complexity is poly(d; log(n)), and the prover runs in time poly(n). In particular, for languages computable by log-space uniform NC (circuits of polylog(n) depth), the prover is efficient, the verifier runs in time n · polylog(n) and space O(log(n)), and the communication complexity is polylog(n).
    [Show full text]