Polynomial Hierarchy

Total Page:16

File Type:pdf, Size:1020Kb

Polynomial Hierarchy Polynomial Hierarchy Klaus Sutner Carnegie Mellon University 2020/04/02 1 The Polynomial Hierarchy 2 Alternating Turing Machines Recall: Arithmetical Hierarchy 2 Recall that there is a natural hierarchy beyond the fundamental classes of decidable and semidecidable problems. ∆4 Σ3 Π3 ∆3 Σ2 Π2 ∆2 Σ1 Π1 ∆1 The hierarchy is proper, and there are fairly straightforward complete problems such as FIN, TOT, REC and so on. Knowldege Transfer 3 We can think of P and NP as an analogue to decidable versus semidecidable (the classes ∆1 versus Σ1 in the AH). This makes it tempting to try and construct a polynomial time hierarchy (PH) analogous to the AH. We mentioned this PH briefly when we first introduced NP, here is some more information. Dire Warning: Note that we will not be able to prove an analogue to Post's hierarchy theorem this time around. Still, it may be interesting to study this putative hierarchy: reducibilities, complete problems, relation to other classes ... Recall: Definition PH 4 p p Σ0 = Π0 = P p p Σn+1 = projP (Πn) p p Πn = comp(Σn) p p p ∆n = Σn \ Πn [ p PH = Σn Here projP refers to polynomially bounded projections: the witness is required to have length polynomial in the length of the witness. comp is just plain complement (unchanged from AH). An Example 5 The standard Independent Set problem looks like so: Problem: Independent Set (IS) Instance: A ugraph G, a number k. Question: Does G have an independent set of size k? The following version makes as much sense: Problem: Maximum Independent Set (MIS) Instance: A ugraph G, a number k. Question: Does the largest independent set in G have size k? Of course, a graph theorist would probably prefer the function version: given G, compute the size of the largest independent set. But, we are trying to stick to decision problems. The Difference 6 It is clear that IS is in NP: guess the set, and verify easily in polynomial time. But MIS seems qualitatively different: we could guess a set I of size k and verify that it is independent, but that does not rule out the existence of an independent set of size > k. The number of subsets of V of size > k is exponential, so it seems doubtful that we could check all of them in polynomial time. MIS seems to belong to a class larger than NP. Boolean Example 7 It is most natural to try to find the smallest Boolean formula equivalent to a given one. This remains a challenge even if we limit the formulae under consideration to, say, DNF. Problem: Minimum Equivalent DNF (MEQDNF) Instance: A Boolean formula Φ in DNF, a bound k. Question: Is Φ equivalent to a DNF formula with at most k literals? We could nondeterministically guess the smallest formula Φ0, but then we need to verify that it is equivalent to Φ, an apparently exponential task. Also note that we are not really gunning for the smallest possible DFN, just one that has at most k literals (the usual trick to get a decision problem). In a more general version of this problem we could consider arbitrary formulae. Automata Example 8 A pattern π is an expression formed from strings in 2? and variables, using only concatenation. We can generate a language L(π) by replacing the variables by strings over 2?. Given (finite) languages P [N] of positive[negative] examples, we would like a pattern that is consistent with P and N. Problem: Pattern Consistency Instance: Two finite languages P; N ⊆ 2?. Question: Is there a pattern π such that P ⊆ L(π) ⊆ N? Again, we could perform a simple nondeterministic guess, but it seems that the guess would have to be followed by an exponential brute-force verification. Graph Example 9 Problem: Node Deletion Instance: Two graphs G and H, a number k. Question: Can one delete at most k vertices from G to obtain a graph that does not contain H as a subgraph? We could nondeterministically guess the vertices that determine the subgraph G0, and then verify that G0 has no subgraph isomorphic to H. Again, the second part seems exponential. p The Class Σ2 10 p Here is an explicit definition of the class Σ2. Definition p L is in Σ2 if there is a polynomial time decidable relation R and a polynomial p such that x 2 L () 9 u 2 2p(jxj) 8 v 2 2p(jxj) R(u; v; x): p So from the definition NP; co-NP ⊆ Σ2. p But there seems to be more: MEQDNF 2 Σ2, since we can guess the desired DNF formula (using the existential quantifiers) and then verify equivalence (using the universal quantifiers). Clearly R can be handled by a deterministic polynomial time Turing machine. p Not only have we seen examples of problems in Σ2, the examples are all complete for this class: Maximum Independent Set Minimum Equivalent DNF Pattern Consistency Node Deletion p TM So Σ2 seems to be a reasonable class that contains at least some RealWorld problems. More Classes 12 p For Σ2 we have one block of existential quantifiers followed by one block of universal quantifiers. Of course, this generalizes: p Σk: k alternating blocks of quantifiers, starting with existential p Πk: k alternating blocks of quantifiers, starting with universal p So e.g. L is in Π3 iff x 2 L () 8 u 2 2p(jxj) 9 v 2 2p(jxj) 8 w 2 2p(jxj) R(u; v; w; x): Note that this description also lends itself nicely to finding a class in the PH that contains a particular given problem: write things down concisely, then count quantifiers. Validity Testing 13 p It is clear from the definitions that Σk is closely connected to the problem of p testing the validity of a Σk Boolean formula (and similarly Πk for Πk): we can express the workings of the Turing machine acceptor as a Boolean formula as in the Cook-Levin theorem. Theorem p Validity of Σk Boolean formulae is Σk-complete wrto polynomial time reductions. p Validity of Πk Boolean formulae is Πk-complete wrto polynomial time reductions. Example: Integer Expressions 14 Define an integer expression to be composed of numbers (written in binary), and binary operations [ and ⊕ where A ⊕ B = f a + b j a 2 A; b 2 B g Write L(E) ⊆ N for the finite set associated with the expression E. An interval in L(E) is a subset [a; b] ⊆ L(E). Problem: Integer Expression Intervals Instance: An integer expression E, a number k. Question: Does L(E) have an interval of length k? Lemma p Integer Expression Intervals is Σ3-complete. More Oracles 15 We know how to attach an oracle A ⊆ Σ? to a Turing machine M. If we do this systematically for all machines in a certain class C, we obtained a relativized class CA. The oracle may vary over a class D: D [ A C = C A2D SAT For example, PP = P and PNP = P . Similar definitions can be obtained for function classes, and function oracles. Alternative Polynomial Hierarchy 16 We can now check that our original definition of PH in terms of projections and complements can also be expressed in terms of oracles like so: p p Σ0 = Π0 = P p p Σn ∆n+1 = P p p Σn Σn+1 = NP p p Πn = comp(Σn) [ p PH = Σn Exercise Verify that our two definitions are really equivalent. There is no analogue to the hierarchy theorem for the arithmetical hierarchy, but it is still true that p p p p p Σk [ Πk ⊆ ∆k+1 ⊆ Σk+1 \ Πk+1 Also, if there is a glitch at some level k ≥ 1, then the rest of the hierarchy collapses: p p p Σk = Πk implies Σk = PH p p p Σk = Σk+1 implies Σk = PH This leaves open the possibility that, say, the first 42 levels are proper, and the rest collapses. Versus PSPACE 18 Lemma PH ⊆ PSPACE. PH = PSPACE implies the polynomial hierarchy collapses. Proof. To see why, recall that QBF Validity is in PSPACE, and subsumes all the Σk Validity problems. If we had equality, then QBF Validity would already be equivalent to Σk Validity for some k. 2 Completeness 19 p We have Σk-complete problems for all levels k ≥ 1, generic as well as concrete. But note that the last argument seems to rule out the existence of p PH-complete problems: if L were PH-complete, then L 2 Σk for some k simply by the definition of the polynomial hierarchy. But then the hierarchy collapses at level k{which sounds less than plausible. Famous last words. Back To Equivalence 20 Recall the question of how small a DNF formula can be made: Problem: Minimum Equivalent DNF Instance: A Boolean formula Φ in DNF, a bound k. Question: Is Φ equivalent to a DNF formula with at most k literals? Here we assume that our language has Boolean variables, constants, and the usual connectives. This version uses the standard leaf-count complexity, there are other analogous measures. Intuitively, MEQDNF seems harder than SAT or TAUT. Let's consider the version where the instance is an arbitrary Boolean formula. SAT to MEQ 21 Lemma SAT is polynomial time Turing reducible to MEQDNF. Proof. Let Φ be an instance of SAT, say, a Boolean formula in CNF. It is easy to check if Φ is a tautology (locally for each clause). If not, Φ is satisfiable iff it is not equivalent to a formula with 0 literals: the constant ?, in which case we are dealing with a contradiction (constant > is ruled out since Φ is not a tautology).
Recommended publications
  • 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]
  • NP-Completeness: Reductions Tue, Nov 21, 2017
    CMSC 451 Dave Mount CMSC 451: Lecture 19 NP-Completeness: Reductions Tue, Nov 21, 2017 Reading: Chapt. 8 in KT and Chapt. 8 in DPV. Some of the reductions discussed here are not in either text. Recap: We have introduced a number of concepts on the way to defining NP-completeness: Decision Problems/Language recognition: are problems for which the answer is either yes or no. These can also be thought of as language recognition problems, assuming that the input has been encoded as a string. For example: HC = fG j G has a Hamiltonian cycleg MST = f(G; c) j G has a MST of cost at most cg: P: is the class of all decision problems which can be solved in polynomial time. While MST 2 P, we do not know whether HC 2 P (but we suspect not). Certificate: is a piece of evidence that allows us to verify in polynomial time that a string is in a given language. For example, the language HC above, a certificate could be a sequence of vertices along the cycle. (If the string is not in the language, the certificate can be anything.) NP: is defined to be the class of all languages that can be verified in polynomial time. (Formally, it stands for Nondeterministic Polynomial time.) Clearly, P ⊆ NP. It is widely believed that P 6= NP. To define NP-completeness, we need to introduce the concept of a reduction. Reductions: The class of NP-complete problems consists of a set of decision problems (languages) (a subset of the class NP) that no one knows how to solve efficiently, but if there were a polynomial time solution for even a single NP-complete problem, then every problem in NP would be solvable in polynomial time.
    [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]
  • NP-Completeness Part I
    NP-Completeness Part I Outline for Today ● Recap from Last Time ● Welcome back from break! Let's make sure we're all on the same page here. ● Polynomial-Time Reducibility ● Connecting problems together. ● NP-Completeness ● What are the hardest problems in NP? ● The Cook-Levin Theorem ● A concrete NP-complete problem. Recap from Last Time The Limits of Computability EQTM EQTM co-RE R RE LD LD ADD HALT ATM HALT ATM 0*1* The Limits of Efficient Computation P NP R P and NP Refresher ● The class P consists of all problems solvable in deterministic polynomial time. ● The class NP consists of all problems solvable in nondeterministic polynomial time. ● Equivalently, NP consists of all problems for which there is a deterministic, polynomial-time verifier for the problem. Reducibility Maximum Matching ● Given an undirected graph G, a matching in G is a set of edges such that no two edges share an endpoint. ● A maximum matching is a matching with the largest number of edges. AA maximummaximum matching.matching. Maximum Matching ● Jack Edmonds' paper “Paths, Trees, and Flowers” gives a polynomial-time algorithm for finding maximum matchings. ● (This is the same Edmonds as in “Cobham- Edmonds Thesis.) ● Using this fact, what other problems can we solve? Domino Tiling Domino Tiling Solving Domino Tiling Solving Domino Tiling Solving Domino Tiling Solving Domino Tiling Solving Domino Tiling Solving Domino Tiling Solving Domino Tiling Solving Domino Tiling The Setup ● To determine whether you can place at least k dominoes on a crossword grid, do the following: ● Convert the grid into a graph: each empty cell is a node, and any two adjacent empty cells have an edge between them.
    [Show full text]
  • The Complexity Zoo
    The Complexity Zoo Scott Aaronson www.ScottAaronson.com LATEX Translation by Chris Bourke [email protected] 417 classes and counting 1 Contents 1 About This Document 3 2 Introductory Essay 4 2.1 Recommended Further Reading ......................... 4 2.2 Other Theory Compendia ............................ 5 2.3 Errors? ....................................... 5 3 Pronunciation Guide 6 4 Complexity Classes 10 5 Special Zoo Exhibit: Classes of Quantum States and Probability Distribu- tions 110 6 Acknowledgements 116 7 Bibliography 117 2 1 About This Document What is this? Well its a PDF version of the website www.ComplexityZoo.com typeset in LATEX using the complexity package. Well, what’s that? The original Complexity Zoo is a website created by Scott Aaronson which contains a (more or less) comprehensive list of Complexity Classes studied in the area of theoretical computer science known as Computa- tional Complexity. I took on the (mostly painless, thank god for regular expressions) task of translating the Zoo’s HTML code to LATEX for two reasons. First, as a regular Zoo patron, I thought, “what better way to honor such an endeavor than to spruce up the cages a bit and typeset them all in beautiful LATEX.” Second, I thought it would be a perfect project to develop complexity, a LATEX pack- age I’ve created that defines commands to typeset (almost) all of the complexity classes you’ll find here (along with some handy options that allow you to conveniently change the fonts with a single option parameters). To get the package, visit my own home page at http://www.cse.unl.edu/~cbourke/.
    [Show full text]
  • CS286.2 Lectures 5-6: Introduction to Hamiltonian Complexity, QMA-Completeness of the Local Hamiltonian Problem
    CS286.2 Lectures 5-6: Introduction to Hamiltonian Complexity, QMA-completeness of the Local Hamiltonian problem Scribe: Jenish C. Mehta The Complexity Class BQP The complexity class BQP is the quantum analog of the class BPP. It consists of all languages that can be decided in quantum polynomial time. More formally, Definition 1. A language L 2 BQP if there exists a classical polynomial time algorithm A that ∗ maps inputs x 2 f0, 1g to quantum circuits Cx on n = poly(jxj) qubits, where the circuit is considered a sequence of unitary operators each on 2 qubits, i.e Cx = UTUT−1...U1 where each 2 2 Ui 2 L C ⊗ C , such that: 2 i. Completeness: x 2 L ) Pr(Cx accepts j0ni) ≥ 3 1 ii. Soundness: x 62 L ) Pr(Cx accepts j0ni) ≤ 3 We say that the circuit “Cx accepts jyi” if the first output qubit measured in Cxjyi is 0. More j0i specifically, letting P1 = j0ih0j1 be the projection of the first qubit on state j0i, j0i 2 Pr(Cx accepts jyi) =k (P1 ⊗ In−1)Cxjyi k2 The Complexity Class QMA The complexity class QMA (or BQNP, as Kitaev originally named it) is the quantum analog of the class NP. More formally, Definition 2. A language L 2 QMA if there exists a classical polynomial time algorithm A that ∗ maps inputs x 2 f0, 1g to quantum circuits Cx on n + q = poly(jxj) qubits, such that: 2q i. Completeness: x 2 L ) 9jyi 2 C , kjyik2 = 1, such that Pr(Cx accepts j0ni ⊗ 2 jyi) ≥ 3 2q 1 ii.
    [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]
  • NP-Completeness Part II
    NP-Completeness Part II Outline for Today ● Recap from Last Time ● What is NP-completeness again, anyway? ● 3SAT ● A simple, canonical NP-complete problem. ● Independent Sets ● Discovering a new NP-complete problem. ● Gadget-Based Reductions ● A common technique in NP reductions. ● 3-Colorability ● A more elaborate NP-completeness reduction. ● Recent News ● Things happened! What were they? Polynomial-Time Reductions ● If A ≤P B and B ∈ P, then A ∈ P. ● If A ≤P B and B ∈ NP, then A ∈ NP. P NP NP-Hardness ● A language L is called NP-hard if for every A ∈ NP, we have A ≤P L. ● A language in L is called NP-complete if L is NP-hard and L ∈ NP. ● The class NPC is the set of NP-complete problems. NP NP-Hard NPC P The Tantalizing Truth Theorem: If any NP-complete language is in P, then P = NP. Proof: Suppose that L is NP-complete and L ∈ P. Now consider any arbitrary NP problem A. Since L is NP-complete, we know that A ≤p L. Since L ∈ P and A ≤p L, we see that A ∈ P. Since our choice of A was arbitrary, this means that NP ⊆ P, so P = NP. ■ P = NP The Tantalizing Truth Theorem: If any NP-complete language is not in P, then P ≠ NP. Proof: Suppose that L is an NP-complete language not in P. Since L is NP-complete, we know that L ∈ NP. Therefore, we know that L ∈ NP and L ∉ P, so P ≠ NP. ■ NP NPC P How do we even know NP-complete problems exist in the first place? Satisfiability ● A propositional logic formula φ is called satisfiable if there is some assignment to its variables that makes it evaluate to true.
    [Show full text]
  • Polynomial Hierarchy
    CSE200 Lecture Notes – Polynomial Hierarchy Lecture by Russell Impagliazzo Notes by Jiawei Gao February 18, 2016 1 Polynomial Hierarchy Recall from last class that for language L, we defined PL is the class of problems poly-time Turing reducible to L. • NPL is the class of problems with witnesses verifiable in P L. • In other words, these problems can be considered as computed by deterministic or nonde- terministic TMs that can get access to an oracle machine for L. The polynomial hierarchy (or polynomial-time hierarchy) can be defined by a hierarchy of problems that have oracle access to the lower level problems. Definition 1 (Oracle definition of PH). Define classes P Σ1 = NP. P • P Σi For i 1, Σi 1 = NP . • ≥ + Symmetrically, define classes P Π1 = co-NP. • P ΠP For i 1, Π co-NP i . i+1 = • ≥ S P S P The Polynomial Hierarchy (PH) is defined as PH = i Σi = i Πi . 1.1 If P = NP, then PH collapses to P P Theorem 2. If P = NP, then P = Σi i. 8 Proof. By induction on i. P Base case: For i = 1, Σi = NP = P by definition. P P ΣP P Inductive step: Assume P NP and Σ P. Then Σ NP i NP P. = i = i+1 = = = 1 CSE 200 Winter 2016 P ΣP Figure 1: An overview of classes in PH. The arrows denote inclusion. Here ∆ P i . (Image i+1 = source: Wikipedia.) Similarly, if any two different levels in PH turn out to be the equal, then PH collapses to the lower of the two levels.
    [Show full text]
  • The Polynomial Hierarchy and Alternations
    Chapter 5 The Polynomial Hierarchy and Alternations “..synthesizing circuits is exceedingly difficulty. It is even more difficult to show that a circuit found in this way is the most economical one to realize a function. The difficulty springs from the large number of essentially different networks available.” Claude Shannon 1949 This chapter discusses the polynomial hierarchy, a generalization of P, NP and coNP that tends to crop up in many complexity theoretic inves- tigations (including several chapters of this book). We will provide three equivalent definitions for the polynomial hierarchy, using quantified pred- icates, alternating Turing machines, and oracle TMs (a fourth definition, using uniform families of circuits, will be given in Chapter 6). We also use the hierarchy to show that solving the SAT problem requires either linear space or super-linear time. p p 5.1 The classes Σ2 and Π2 To understand the need for going beyond nondeterminism, let’s recall an NP problem, INDSET, for which we do have a short certificate of membership: INDSET = {hG, ki : graph G has an independent set of size ≥ k} . Consider a slight modification to the above problem, namely, determin- ing the largest independent set in a graph (phrased as a decision problem): EXACT INDSET = {hG, ki : the largest independent set in G has size exactly k} . Web draft 2006-09-28 18:09 95 Complexity Theory: A Modern Approach. c 2006 Sanjeev Arora and Boaz Barak. DRAFTReferences and attributions are still incomplete. P P 96 5.1. THE CLASSES Σ2 AND Π2 Now there seems to be no short certificate for membership: hG, ki ∈ EXACT INDSET iff there exists an independent set of size k in G and every other independent set has size at most k.
    [Show full text]