Probabilistic Autoreductions
|
|
- Ernest Washington
- 5 years ago
- Views:
Transcription
1 Probabilistic Autoreductions Liyu Zhang University of Texas Rio Grande Valley Joint Work with Chen Yuan and Haibin Kan SOFSEM
2 Overview Introduction to Autoreducibility Previous Results Main Result 1: Complete sets for NP are autoreducible for the probabilistic many-one (Karp) reduction. Main Result 2: Complete sets for classes in the truth-table polynomial hierarchy are autoreducible for the probabilistic truth-table reduction. Q & A 2
3 Autoreducibility: Definition A set A is r-autoreducible set if A reduces to itself via a r-reduction that does not query on the input element itself. Being autoreducible means redundancy: Information about x A? can be retrieved from the information about whether y 1, y 2,..., y m A, where each y i x. 3
4 Autoreducibility: Background The research on autoreducibilities of (complete) sets started as early as 1970 s (Trakhtenbrot) mainly in the recursive setting. Ambos-Spies (1984) translated the notion of autoreducibility to the polynomial-time setting. It attracted more attention in the past two decades (see survey by Glaßer et al., 2009) because it was considered a promising property to apply the Post s program (1944) in order to attacking major unsolved separation problems in complexity theory (Buhrman and Torenvliet, 2005 and Buhrman et al. 2000). 4
5 Current Status: Autoreducibility of Complete Sets p m p 1-tt p tt p T NP yes yes open yes Σ P i yes yes open yes Π P i yes yes open yes P i yes yes yes yes PSPACE yes yes open yes EXP yes yes open yes NEXP yes yes open open Solving highlighted problems will lead to major breakthrough in complexity theory (Buhrman et al, ) 5
6 Autoreducibility: This Work This work: we investigate autoreducibilities under probabilistic reductions and attempt to extend some of the previous results on deterministic reductions to their probabilistic counterparts. 6
7 Notations We use standard notations: Complexity classes: P, NP, Σ P k, PH, RP, BPP,etc. reductions (all polynomial time): p m, p tt, p T, etc. 7
8 Many-one Autoreducible Sets For the common many-one ( p m, Karp) reduction, a set A is autoreducible if there exists a polynomial-time computable function f such that for every x, x A f(x) A, and f(x) x 8
9 Many-one Autoreducible Sets: An Illustration x f(x) A f(f(x))... Figure 1: Many-one Autoreducible Sets. x A f(x) A f(f(x)) A x f(x) f(f(x)) (but f(f(x)) might equal x) 9
10 Autoreducibility of Known NP-complete Sets Most known NP-complete (for the many-one reduction) sets are autoreducible simply because they are p-cylinders. Example: f(x) = x TRUE is an autoreduction of SAT, the set of satisfiable propositional formulas: x, x TRUE x. x, x SAT x TRUE SAT. Question: Are all NP-complete sets are autoreducible? Note that if the Isomorphism Conjecture by Hartmanis and Berman is true, then trivially all NP-complete sets are many-one autoreducible. 10
11 p m -Autoreducibility of Complete Sets Glaßer, Ogihara, Pavan, Selman and Zhang, 2007: For the p m reduction, all Nontrivial NP-complete sets are autoreducible, and so are complete sets of many other classes: P, EXP, PSPACE, etc. Note: Here we define a set A to be nontrivial if both A and A are no less than 2. We assume that all sets in our discussion are nontrivial. 11
12 Autoreducibility Proof of NPC Sets: Basic Setup We show the proof idea of Glaßer et al. s result using an NP-complete Set. Basic Setup: Let A be an NPC set accepted by an NTM N in time p(n) for a polynomial p. Assume each computation path of N is a string over {0, 1} of length p(n). Define the following left set (Ogiwara and Watanabe, 1991) B of A: B = { x, y N accepts x along some path w such that y w }, where is based on the common lexicographical ordering. Clearly B NP and therefore reduces to A via some reduction f. Let {a, b} A and {c, d} A. 12
13 Autoreducibility Proof for NPC Sets: Constructing Autoreduction Constructing the autoreduction g ; Case 1: z = f( x, 0 m ) x. Output z. Case 2: z = f( x, 1 m ) = x. Subcase 2.1: N accepts x along the path 1 m. Output {a, b} {x} Subcase 2.2: N does not accept x along the path 1 m. Output {c, d} x. Case 3: Not in cases 1 or 2. Find w such that f( x, w ) = x and z = f( x, w + 1 ) x. Subcase 3.1: N accepts x along the path w. Output {a, b} {x}. Subcase 3.2: N does not accept x along the path w + 1. Output z. 13
14 Autoreducibility Proof for NPC Sets: An Illustration x 0^m w w+1 1^m f(x,0^m)=x f(x,w) = x f(x,w+1)!= x f(x,1^m)!= x Figure 2: Computation Tree of N on input x. Each leave if labeled with f( x, y ), where y is the computation path between the leave and the root. 14
15 Autoreducibility Proof for NPC Sets: Correctness The function g defined in the last slide is an p m -autoreduction for A due to the following observations: g is polynomial-time computable. ( u {0, 1} p( x ) ) f( x, u ) A. f( x, 0 m ) A iff x A. f( x, 1 m ) A iff N accepts x along the path 1 m. For w {0, 1} m {0 m, 1 m }, if N does not accept x along the path w, then f( x, w ) A iff f( x, w + 1 ) A. 15
16 Autoreducibility of Other Complete Sets Extending the autoreducibility result to complete sets of other classes, for example, PSPACE, is not straightforward. Additional properties of those complete sets must be used in a nontrivial way in order to prove their autoreducibility. 16
17 RP Many-one Autoreducible Sets Now we consider the following RP-type probabilistic many-one reduction due to Valiant and Vazirani (1986): A set A is RP many-one reducible ( rp m ) to another set B if there exists a probabilistic polynomial-time computable function f and a polynomial q such that for every input x, x A Pr[f(x) A] 1/q( x ), and x A Pr[f(x) A] = 0. Furthermore, A is rp m -autoreducible if A rp m A via a function f and f(x) x for every input x. 17
18 rp m -Autoreducibility Proof for NPC Sets To prove rp m -autoreducibility of rp m -complete sets for NP, use the following function f in place of the function f in the proof for the p m -autoreducibility of NPC sets: Function f : 0 Input x, y, where x = n and y = p(n) 1 Run f on x, y for r(n) times for some polynomial r and let S be the set of the r(n) outputs from Step 2. 2 If x S, output x 3 Else output z, where z is a randomly selected from S. Note: Here r(n) is a polynomial to be determined later. 18
19 rp m -Autoreducibility Proof for NPC Sets, cont d The rp m -autoreduction g for a rp m -complete set A for NP is similar to the one for the NPC set A with two changes: f is replaced by f. The output in Subcase 3.2 will be now determined in the following way: Run f on x, w + 1 again and yield output z Output z ifz x, or {b1, b2} {x} otherwise. Note: The 2nd change above is important and to ensure the autoreduction outputs an appropriate element with sufficient probability. 19
20 rp m -Autoreducibility Proof for NPC Set, cont d rp m -autoreduction for rp m -complete sets for NP: Case 1: z = f ( x, 0 m ) x. Output z. Case 2: z = f ( x, 1 m ) = x. Subcase 2.1: N accepts x along the path 1 m. Output {a, b} {x} Subcase 2.2: N does not accept x along the path 1 m. Output {c, d} x. Case 3: Not in cases 1 or 2. Find w such that f ( x, w ) = x and z = f ( x, w + 1 ) x. Subcase 3.1: N accepts x along the path w. Output {a, b} {x}. Subcase 3.2: Run f on x, w + 1 again and yield output z. Output z ifz x, or {b1, b2} {x} otherwise. 20
21 Proof of Correctness for rp m -autoreduction To prove the correctness of g, we first make the following straightforward observations: g is polynomial-time computable. For every input x, Pr[g (x) x] = 1. For every input x A, Pr[g (x) A] = 0. 21
22 Proof of Correctness for rp m -autoreduction, cont d Now it only remains to show that ( polynomial q ) ( x A) Pr[g(x) A] 1/q ( x ). We consider the following types of strings u {0, 1} p(n) for a fixed x with x = n: good: if Pr[f( x, u ) = x] 1/2q(n). (f( x, u ) output a non-x element with sufficient likelihood.) bad: otherwise. 22
23 Proof of Correctness for rp m -autoreduction, cont d We arrived at three cases: Case 1: 0 m is good. Easy since f( x, 0 m ) x with sufficiently large probability. Case 2: 1 m is bad. Easy since f( x, 1 m ) = x with sufficiently large probability. Case 3: 0 m is bad and 1 m is good. Need more work. 23
24 Proof of Correctness for rp m -autoreduction, cont d Case 3 for rp m -autoreduction: 0 m is bad and 1 m is good. Still need to find w, where f ( x, w ) = x and z = f ( x, w + 1 ) x. but need to ensure that an appropriate w is found with sufficiently large probability. We observe that it suffices that all the events S i defined below occur in order to warrant an appropriate w : S i : u i is bad f ( x, u i ) = x, where u i denotes the i-th string for which f( x, u i ) is computed during the search for w. 24
25 Proof of Correctness for rp m -autoreduction: The Last Step Finally we were able to prove that the probability for i S i is at least 1/t(n) for some polynomial t with the following observation where appropriate r(n) is used in f : For every u Σ m and s = f ( x, u ), i. if u is good, then (a) Pr[s x] 1 2p(n), and (b) x, u B Pr[s L s x] 1 r(n) for some polynomial r(n). ii. if u is bad, then Pr[s = x] > 1 2 p(n). 25
26 BPP Truth-table Reduction: Definition BPP Truth-table Reduction: A bpp tt B if there exist a probabilistic polynomial-time oracle algorithm A, and a (deterministically) polynomial-time computable function g, where for every input x: g(x) outputs all queries A will make to B. If x A, then Pr[A B accepts x] 2 3. If x A, then Pr[A B accepts x] 1 3. Using probability amplification: x, x. 26
27 bpp tt -Autoreducibility of NPC Sets Let L be a bpp tt -complete set for NP. Fix the following: r L : a length-increasing p m -reduction from L to SAT. r vv : The rp m -reduction from SAT to USAT with one-sided error 1/4 by Valiant and Vazirani (1986). T = φ, 0i φ SAT has a satisfying assignment where the i-th variable is true. 27
28 bpp tt -Autoreducibility of NPC Sets: an Algorithm Buhrman et al. (2000) used the following algorithm M to show that p tt -complete sets for NP are bpp tt -autoreducible: 0 Input x 1 Compute φ = r L (x) and ψ = r vv (φ). 2 Determine the memberships of ψ, 0 i in T by making truth-table queries to L {x} and L {x}, respectively. 3 Let a 0 and a 1 be the two assignments induced by the two sets of memberships of ψ, 0 i in T, as determined in Line 2 4 Evaluating ψ(a 0 ) and ψ(a 1 ). 5 If the above ψ(a 0 ) or ψ(a 1 ) evaluates to true, ACCEPT. 6 REJECT. 28
29 bpp tt -Autoreducibility of NPC Sets: Correctness The correctness of the algorithm M is as follows: x L φ = r L (x) SAT Pr[ψ = r vv (φ) SAT] = 0 (By Valiant and Vazirani (1986)) Pr[ M accepts φ] = 0 (Due to verification of the satisfying assignment at line 5) x L φ SAT Pr[ψ = r vv (φ) SAT] 1 4 (By Valiant and Vazirani (1986)) Pr[ M accepts φ] 1 4 (since a 0 or a 1 is a satisfying assignment) 29
30 Generalizing Algorithm M We attempt to generalize algorithm M to a bpp tt -autoreduction for an arbitrary complete set for a higher class in PH: Define SAT (k) to serve as the role of SAT for Σ P k : SAT (1) = SAT and SAT (k) = SAT SAT(k 1) for every k 2. SAT A is the same as SAT except literals can be of the form A(w), where w consists of variables and T/F s and A(w) = 1 iff w A. It s well known that SAT (k) is p m -complete for Σ P k. 30
31 Generalizing Algorithm M, cont d Generalizing Algorithm M, cont d: Consider a bpp tt -complete set L k for Σ P k Use a p m -reduction r k from L k to SAT (k)., where k 2. The other components of M can be generalized in a similar fashion: r vv, T, etc. However, there is a critical problem... 31
32 Generalizing Algorithm M: A Critical Problem Problem: Line 4 of the algorithm M now requires p T -access to a p T -complete set for ΣP k 1 since now they might contain literals of the form SAT (k 1) (w). 4 Evaluating ψ(a 0 ) and ψ(a 1 ). 32
33 Generalizing Algorithm M: A Critical Problem, cont d To address the problem in the last slide: limit L k to be a bpp tt Σ P k in the PH defined using bpp Now the desired bpp tt a bpp tt -complete set for Σ P,tt k, the counterpart of tt instead of p T. -autoreduction A for Σ P,tt k -reduction (not autoreduction) from SAT (k 1) to L k in needs to utilize order to resolve queries to SAT (k 1), which recursively requires the same reduction from SAT (k 2) to L k, and so on. Some extra care is also needed in order for the bpp tt -autoreduction A to decide L k with sufficiently small two-sided error probability. 33
34 Putting It Together: An bpp tt -autoreduction for L k A k : An probabilistic algorithm with truth-table oracle access to L k that on input φ, y, 0 n decides whether φ SAT (k) with high probability ( 1/2 n ), without querying on y. To construct A k, we also need to construct A k 1, A k 2,..., A 1. A: the bpp tt -autoreduction for L k that on input x computes φ = r k (x), runs A k on φ, x, 0 n and accepts iff A k accepts. 34
35 Corollaries of Main Result 2 Corollary: All bpp tt -autoreducible: bpp tt -complete sets in the following classes are PH tt : the counterpart of PH for p tt reductions. Θ P -levels (Wagner, 1990): Θ P 0 = P, and Θ P k+1 = LΣP k, where L denotes a log-space oracle Turing machine. 35
36 Probabilistic Autoreductions Questions? Thank You! 36
Probabilistic Autoreductions
Probabilistic Autoreductions Liyu Zhang 1, Chen Yuan 3, and Haibin Kan 2 1 Departmente of Computer Science, University of Texas Rio Grande Valley, Brownsville, Texas, 78520, USA. liyu.zhang@utrgv.edu 2
More informationMitosis in Computational Complexity
Mitosis in Computational Complexity Christian Glaßer 1, A. Pavan 2, Alan L. Selman 3, and Liyu Zhang 4 1 Universität Würzburg, glasser@informatik.uni-wuerzburg.de 2 Iowa State University, pavan@cs.iastate.edu
More informationAutoreducibility, Mitoticity, and Immunity
Autoreducibility, Mitoticity, and Immunity Christian Glaßer, Mitsunori Ogihara, A. Pavan, Alan L. Selman, Liyu Zhang December 21, 2004 Abstract We show the following results regarding complete sets. NP-complete
More informationAutoreducibility of NP-Complete Sets under Strong Hypotheses
Autoreducibility of NP-Complete Sets under Strong Hypotheses John M. Hitchcock and Hadi Shafei Department of Computer Science University of Wyoming Abstract We study the polynomial-time autoreducibility
More informationSeparating NE from Some Nonuniform Nondeterministic Complexity Classes
Separating NE from Some Nonuniform Nondeterministic Complexity Classes Bin Fu 1, Angsheng Li 2, and Liyu Zhang 3 1 Dept. of Computer Science, University of Texas - Pan American TX 78539, USA. binfu@cs.panam.edu
More informationLength-Increasing Reductions for PSPACE-Completeness
Length-Increasing Reductions for PSPACE-Completeness John M. Hitchcock 1 and A. Pavan 2 1 Department of Computer Science, University of Wyoming. jhitchco@cs.uwyo.edu 2 Department of Computer Science, Iowa
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 information: On the P vs. BPP problem. 30/12/2016 Lecture 11
03684155: On the P vs. BPP problem. 30/12/2016 Lecture 11 Promise problems Amnon Ta-Shma and Dean Doron 1 Definitions and examples In a promise problem, we are interested in solving a problem only on a
More informationAutoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences 73 (2007) 735 754 www.elsevier.com/locate/jcss Autoreducibility, mitoticity, and immunity Christian Glaßer a, Mitsunori Ogihara b,1,a.pavan c,,2,alanl.selman d,3,
More informationIdentifying an Honest EXP NP Oracle Among Many
Identifying an Honest EXP NP Oracle Among Many Shuichi Hirahara The University of Tokyo CCC 18/6/2015 Overview Dishonest oracle Honest oracle Queries Which is honest? Our Contributions Selector 1. We formulate
More informationRobustness of PSPACE-complete sets
Robustness of PSPACE-complete sets A. Pavan a,1 and Fengming Wang b,1 a Department of Computer Science, Iowa State University. pavan@cs.iastate.edu b Department of Computer Science, Rutgers University.
More informationThe Computational Complexity Column
The Computational Complexity Column by Jacobo Torán Dept. Theoretische Informatik, Universität Ulm Oberer Eselsberg, 89069 Ulm, Germany toran@informatik.uni-ulm.de http://theorie.informatik.uni-ulm.de/personen/jt.html
More informationSeparating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis
Separating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis Debasis Mandal A. Pavan Rajeswari Venugopalan Abstract We show that there is a language that is Turing complete
More informationComparing Reductions to NP-Complete Sets
Comparing Reductions to NP-Complete Sets John M. Hitchcock A. Pavan Abstract Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following:
More informationAdvanced Algorithms (XIII) Yijia Chen Fudan University
Advanced Algorithms (XIII) Yijia Chen Fudan University The PCP Theorem Theorem NP = PCP(log n, 1). Motivation Approximate solutions Definition (Approximation of MAX-3SAT) For every 3CNF formula ϕ, the
More informationProving SAT does not have Small Circuits with an Application to the Two Queries Problem
Proving SAT does not have Small Circuits with an Application to the Two Queries Problem Lance Fortnow A. Pavan Samik Sengupta Abstract We show that if SAT does not have small circuits, then there must
More informationUmans Complexity Theory Lectures
Umans Complexity Theory Lectures Lecture 12: The Polynomial-Time Hierarchy Oracle Turing Machines Oracle Turing Machine (OTM): Deterministic multitape TM M with special query tape special states q?, q
More informationRandomized Complexity Classes; RP
Randomized Complexity Classes; RP Let N be a polynomial-time precise NTM that runs in time p(n) and has 2 nondeterministic choices at each step. N is a polynomial Monte Carlo Turing machine for a language
More informationMultiobjective Traveling Salesman Problems and Redundancy of Complete Sets
Multiobjective Traveling Salesman Problems and Redundancy of Complete Sets Dissertation zur Erlangung des naturwissenschaftlichen Doktorgrades der Julius-Maximilians-Universität Würzburg vorgelegt von
More information1 Randomized complexity
80240233: Complexity of Computation Lecture 6 ITCS, Tsinghua Univesity, Fall 2007 23 October 2007 Instructor: Elad Verbin Notes by: Zhang Zhiqiang and Yu Wei 1 Randomized complexity So far our notion of
More informationLecture 22: Counting
CS 710: Complexity Theory 4/8/2010 Lecture 22: Counting Instructor: Dieter van Melkebeek Scribe: Phil Rydzewski & Chi Man Liu Last time we introduced extractors and discussed two methods to construct them.
More informationAmplifying ZPP SAT[1] and the Two Queries Problem
Amplifying and the Two Queries Problem Richard Chang Suresh Purini University of Maryland Baltimore County Abstract This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP,
More informationA Note on the Karp-Lipton Collapse for the Exponential Hierarchy
A Note on the Karp-Lipton Collapse for the Exponential Hierarchy Chris Bourke Department of Computer Science & Engineering University of Nebraska Lincoln, NE 68503, USA Email: cbourke@cse.unl.edu January
More informationSparse Sets, Approximable Sets, and Parallel Queries to NP. Abstract
Sparse Sets, Approximable Sets, and Parallel Queries to NP V. Arvind Institute of Mathematical Sciences C. I. T. Campus Chennai 600 113, India Jacobo Toran Abteilung Theoretische Informatik, Universitat
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 18, 2012 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More informationTuring Machines With Few Accepting Computations And Low Sets For PP
Turing Machines With Few Accepting Computations And Low Sets For PP Johannes Köbler a, Uwe Schöning a, Seinosuke Toda b, Jacobo Torán c a Abteilung Theoretische Informatik, Universität Ulm, 89069 Ulm,
More informationNP Might Not Be As Easy As Detecting Unique Solutions
NP Might Not Be As Easy As Detecting Unique Solutions Richard Beigel Lehigh University Harry Buhrman x CWI Lance Fortnow { University of Chicago Abstract We construct an oracle A such that P A = P A and
More informationBi-Immunity Separates Strong NP-Completeness Notions
Bi-Immunity Separates Strong NP-Completeness Notions A. Pavan 1 and Alan L Selman 2 1 NEC Research Institute, 4 Independence way, Princeton, NJ 08540. apavan@research.nj.nec.com 2 Department of Computer
More informationThe Complexity of Unions of Disjoint Sets
Electronic Colloquium on Computational Complexity, Report No. 69 (2006) The Complexity of Unions of Disjoint Sets Christian Glaßer, Alan L. Selman, Stephen Travers, and Klaus W. Wagner Abstract This paper
More informationLecture 24: Randomized Complexity, Course Summary
6.045 Lecture 24: Randomized Complexity, Course Summary 1 1/4 1/16 1/4 1/4 1/32 1/16 1/32 Probabilistic TMs 1/16 A probabilistic TM M is a nondeterministic TM where: Each nondeterministic step is called
More informationOn the NP-Completeness of the Minimum Circuit Size Problem
On the NP-Completeness of the Minimum Circuit Size Problem John M. Hitchcock Department of Computer Science University of Wyoming A. Pavan Department of Computer Science Iowa State University Abstract
More information15-855: Intensive Intro to Complexity Theory Spring Lecture 7: The Permanent, Toda s Theorem, XXX
15-855: Intensive Intro to Complexity Theory Spring 2009 Lecture 7: The Permanent, Toda s Theorem, XXX 1 #P and Permanent Recall the class of counting problems, #P, introduced last lecture. It was introduced
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 informationIntroduction to Advanced Results
Introduction to Advanced Results Master Informatique Université Paris 5 René Descartes 2016 Master Info. Complexity Advanced Results 1/26 Outline Boolean Hierarchy Probabilistic Complexity Parameterized
More informationA Short History of Computational Complexity
A Short History of Computational Complexity Lance Fortnow, Steve Homer Georgia Kaouri NTUAthens Overview 1936: Turing machine early 60 s: birth of computational complexity early 70 s: NP-completeness,
More informationIntroduction to Complexity Theory. Bernhard Häupler. May 2, 2006
Introduction to Complexity Theory Bernhard Häupler May 2, 2006 Abstract This paper is a short repetition of the basic topics in complexity theory. It is not intended to be a complete step by step introduction
More informationA Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP
A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP Ashish V. Naik Alan L. Selman Abstract We study two properties of a complexity class whether there exists a truthtable hard p-selective
More informationNotes on Complexity Theory Last updated: November, Lecture 10
Notes on Complexity Theory Last updated: November, 2015 Lecture 10 Notes by Jonathan Katz, lightly edited by Dov Gordon. 1 Randomized Time Complexity 1.1 How Large is BPP? We know that P ZPP = RP corp
More informationComplexity Theory. Knowledge Representation and Reasoning. November 2, 2005
Complexity Theory Knowledge Representation and Reasoning November 2, 2005 (Knowledge Representation and Reasoning) Complexity Theory November 2, 2005 1 / 22 Outline Motivation Reminder: Basic Notions Algorithms
More informationLecture 23: Alternation vs. Counting
CS 710: Complexity Theory 4/13/010 Lecture 3: Alternation vs. Counting Instructor: Dieter van Melkebeek Scribe: Jeff Kinne & Mushfeq Khan We introduced counting complexity classes in the previous lecture
More informationRelativized Worlds with an Innite Hierarchy. Lance Fortnow y. University of Chicago E. 58th. St. Chicago, IL Abstract
Relativized Worlds with an Innite Hierarchy Lance Fortnow y University of Chicago Department of Computer Science 1100 E. 58th. St. Chicago, IL 60637 Abstract We introduce the \Book Trick" as a method for
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 informationProperties of NP-Complete Sets
Properties of NP-Complete Sets Christian Glaßer, A. Pavan, Alan L. Selman, Samik Sengupta Abstract We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set
More informationDerandomizing from Random Strings
Derandomizing from Random Strings Harry Buhrman CWI and University of Amsterdam buhrman@cwi.nl Lance Fortnow Northwestern University fortnow@northwestern.edu Michal Koucký Institute of Mathematics, AS
More informationComputational Complexity of Bayesian Networks
Computational Complexity of Bayesian Networks UAI, 2015 Complexity theory Many computations on Bayesian networks are NP-hard Meaning (no more, no less) that we cannot hope for poly time algorithms that
More informationGRAPH ISOMORPHISM IS LOW FOR PP
GRAPH ISOMORPHISM IS LOW FOR PP Johannes Köbler, Uwe Schöning and Jacobo Torán Abstract. We show that the graph isomorphism problem is low for PP and for C = P, i.e., it does not provide a PP or C = P
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 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 informationThe Complexity of Complexity
The Complexity of Complexity New Insights on the (Non)hardness of Circuit Minimization and Related Problems Eric Allender Rutgers University Joint work with Shuichi Hirara (U. Tokyo) RodFest, January 5,
More information: Computational Complexity Lecture 3 ITCS, Tsinghua Univesity, Fall October 2007
80240233: Computational Complexity Lecture 3 ITCS, Tsinghua Univesity, Fall 2007 16 October 2007 Instructor: Andrej Bogdanov Notes by: Jialin Zhang and Pinyan Lu In this lecture, we introduce the complexity
More information2. Notation and Relative Complexity Notions
1. Introduction 1 A central issue in computational complexity theory is to distinguish computational problems that are solvable using efficient resources from those that are inherently intractable. Computer
More information1 From previous lectures
CS 810: Introduction to Complexity Theory 9/18/2003 Lecture 11: P/poly, Sparse Sets, and Mahaney s Theorem Instructor: Jin-Yi Cai Scribe: Aparna Das, Scott Diehl, Giordano Fusco 1 From previous lectures
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 informationOn Unique Satisfiability and Randomized Reductions. Department of Computer Science, Cornell University Ithaca, New York 14853, USA
On Unique Satisfiability and Randomized Reductions Richard Chang Pankaj Rohatgi Department of Computer Science, Cornell University Ithaca, New York 14853, USA Abstract Ever since Valiant and Vazirani [VV86]
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 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 informationCS154, Lecture 17: conp, Oracles again, Space Complexity
CS154, Lecture 17: conp, Oracles again, Space Complexity Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode: Guess string
More informationLimits of Minimum Circuit Size Problem as Oracle
Limits of Minimum Circuit Size Problem as Oracle Shuichi Hirahara(The University of Tokyo) Osamu Watanabe(Tokyo Institute of Technology) CCC 2016/05/30 Minimum Circuit Size Problem (MCSP) Input Truth table
More informationNon-Approximability Results (2 nd part) 1/19
Non-Approximability Results (2 nd part) 1/19 Summary - The PCP theorem - Application: Non-approximability of MAXIMUM 3-SAT 2/19 Non deterministic TM - A TM where it is possible to associate more than one
More informationDRAFT. Diagonalization. Chapter 4
Chapter 4 Diagonalization..the relativized P =?NP question has a positive answer for some oracles and a negative answer for other oracles. We feel that this is further evidence of the difficulty of the
More informationNP-completeness was introduced by Stephen Cook in 1971 in a foundational paper.
NP Completeness NP-completeness was introduced by Stephen Cook in 1971 in a foundational paper. Leonid Levin independently introduced the same concept and proved that a variant of SAT is NP-complete. 1.
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 informationA Thirty Year Old Conjecture about Promise Problems
A Thirty Year Old Conjecture about Promise Problems Andrew Hughes Debasis Mandal A. Pavan Nathan Russell Alan L. Selman Abstract Even, Selman, and Yacobi [ESY84, SY82] formulated a conjecture that in current
More informationThe Informational Content of Canonical Disjoint NP-Pairs
The Informational Content of Canonical Disjoint NP-Pairs Christian Glaßer Alan L. Selman Liyu Zhang June 17, 2009 Abstract We investigate the connection between propositional proof systems and their canonical
More informationBBM402-Lecture 11: The Class NP
BBM402-Lecture 11: The Class NP Lecturer: Lale Özkahya Resources for the presentation: http://ocw.mit.edu/courses/electrical-engineering-andcomputer-science/6-045j-automata-computability-andcomplexity-spring-2011/syllabus/
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 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 informationStrong Reductions and Isomorphism of Complete Sets
Strong Reductions and Isomorphism of Complete Sets Ryan C. Harkins John M. Hitchcock A. Pavan Abstract We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic
More informationWelcome to... Problem Analysis and Complexity Theory , 3 VU
Welcome to... Problem Analysis and Complexity Theory 716.054, 3 VU Birgit Vogtenhuber Institute for Software Technology email: bvogt@ist.tugraz.at office: Inffeldgasse 16B/II, room IC02044 slides: http://www.ist.tugraz.at/pact17.html
More informationCSE 135: Introduction to Theory of Computation NP-completeness
CSE 135: Introduction to Theory of Computation NP-completeness Sungjin Im University of California, Merced 04-15-2014 Significance of the question if P? NP Perhaps you have heard of (some of) the following
More informationA Thirty Year Old Conjecture about Promise Problems
A Thirty Year Old Conjecture about Promise Problems Andrew Hughes 1, A. Pavan 2, Nathan Russell 1, and Alan Selman 1 1 Department of Computer Science and Engineering, University at Buffalo. {ahughes6,nrussell,selman}@buffalo.edu
More informationLimitations of Efficient Reducibility to the Kolmogorov Random Strings
Limitations of Efficient Reducibility to the Kolmogorov Random Strings John M. HITCHCOCK 1 Department of Computer Science, University of Wyoming Abstract. We show the following results for polynomial-time
More information6.045: Automata, Computability, and Complexity (GITCS) Class 17 Nancy Lynch
6.045: Automata, Computability, and Complexity (GITCS) Class 17 Nancy Lynch Today Probabilistic Turing Machines and Probabilistic Time Complexity Classes Now add a new capability to standard TMs: random
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 informationBeyond NP [HMU06,Chp.11a] Tautology Problem NP-Hardness and co-np Historical Comments Optimization Problems More Complexity Classes
Beyond NP [HMU06,Chp.11a] Tautology Problem NP-Hardness and co-np Historical Comments Optimization Problems More Complexity Classes 1 Tautology Problem & NP-Hardness & co-np 2 NP-Hardness Another essential
More informationSome Results on Derandomization
Some Results on Derandomization Harry Buhrman CWI and University of Amsterdam Lance Fortnow University of Chicago A. Pavan Iowa State University Abstract We show several results about derandomization including
More informationLecture 7: Polynomial time hierarchy
Computational Complexity Theory, Fall 2010 September 15 Lecture 7: Polynomial time hierarchy Lecturer: Kristoffer Arnsfelt Hansen Scribe: Mads Chr. Olesen Recall that adding the power of alternation gives
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 informationDefinition: conp = { L L NP } What does a conp computation look like?
Space Complexity 28 Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode: Guess string y of x k length and the machine accepts
More informationQuantum Computing Lecture 8. Quantum Automata and Complexity
Quantum Computing Lecture 8 Quantum Automata and Complexity Maris Ozols Computational models and complexity Shor s algorithm solves, in polynomial time, a problem for which no classical polynomial time
More informationAlmost transparent short proofs for NP R
Brandenburgische Technische Universität, Cottbus, Germany From Dynamics to Complexity: A conference celebrating the work of Mike Shub Toronto, May 10, 2012 Supported by DFG under GZ:ME 1424/7-1 Outline
More informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Reasoning Complexity Theory Bernhard Nebel, Malte Helmert and Stefan Wölfl Albert-Ludwigs-Universität Freiburg April 29, 2008 Nebel, Helmert, Wölfl (Uni Freiburg)
More informationPseudo-Deterministic Proofs
Pseudo-Deterministic Proofs Shafi Goldwasser 1, Ofer Grossman 2, and Dhiraj Holden 3 1 MIT, Cambridge MA, USA shafi@theory.csail.mit.edu 2 MIT, Cambridge MA, USA ofer.grossman@gmail.com 3 MIT, Cambridge
More informationPolynomial-Time Random Oracles and Separating Complexity Classes
Polynomial-Time Random Oracles and Separating Complexity Classes John M. Hitchcock Department of Computer Science University of Wyoming jhitchco@cs.uwyo.edu Adewale Sekoni Department of Computer Science
More informationLecture 24: Approximate Counting
CS 710: Complexity Theory 12/1/2011 Lecture 24: Approximate Counting Instructor: Dieter van Melkebeek Scribe: David Guild and Gautam Prakriya Last time we introduced counting problems and defined the class
More information4. The Isolation Technique
4. The Isolation Technique Brother: And the Lord spake, saying, First shalt thou take out the Holy Pin. Then, shalt thou count to three, no more, no less. Three shalt be the number thou shalt count, and
More informationOn Basing Lower-Bounds for Learning on Worst-Case Assumptions
On Basing Lower-Bounds for Learning on Worst-Case Assumptions Benny Applebaum Boaz Barak David Xiao Abstract We consider the question of whether P NP implies that there exists some concept class that is
More informationReview of Basic Computational Complexity
Lecture 1 Review of Basic Computational Complexity March 30, 2004 Lecturer: Paul Beame Notes: Daniel Lowd 1.1 Preliminaries 1.1.1 Texts There is no one textbook that covers everything in this course. Some
More informationNon-Mitotic Sets. 22nd June Abstract
Non-Mitotic Sets Christian Glasser, Alan L. Selman, Stephen Travers, and Liyu Zhang 22nd June 2006 Abstract We study the question of the existence of non-mitotic sets in NP. We show under various hypotheses
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 informationNP-Completeness Part II
NP-Completeness Part II Recap from Last Time NP-Hardness A language L is called NP-hard iff for every L' NP, we have L' P L. A language in L is called NP-complete iff L is NP-hard and L NP. The class NPC
More informationCompute the Fourier transform on the first register to get x {0,1} n x 0.
CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary
More informationCSCI 1590 Intro to Computational Complexity
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
More informationCS154, Lecture 13: P vs NP
CS154, Lecture 13: P vs NP The EXTENDED Church-Turing Thesis Everyone s Intuitive Notion of Efficient Algorithms Polynomial-Time Turing Machines More generally: TM can simulate every reasonable model of
More informationLimits to Approximability: When Algorithms Won't Help You. Note: Contents of today s lecture won t be on the exam
Limits to Approximability: When Algorithms Won't Help You Note: Contents of today s lecture won t be on the exam Outline Limits to Approximability: basic results Detour: Provers, verifiers, and NP Graph
More informationCSCI 1590 Intro to Computational Complexity
CSCI 1590 Intro to Computational Complexity Interactive Proofs John E. Savage Brown University April 20, 2009 John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity April 20, 2009
More information6.045 Final Exam Solutions
6.045J/18.400J: Automata, Computability and Complexity Prof. Nancy Lynch, Nati Srebro 6.045 Final Exam Solutions May 18, 2004 Susan Hohenberger Name: Please write your name on each page. This exam is open
More informationP = k T IME(n k ) Now, do all decidable languages belong to P? Let s consider a couple of languages:
CS 6505: Computability & Algorithms Lecture Notes for Week 5, Feb 8-12 P, NP, PSPACE, and PH A deterministic TM is said to be in SP ACE (s (n)) if it uses space O (s (n)) on inputs of length n. Additionally,
More informationMa/CS 117c Handout # 5 P vs. NP
Ma/CS 117c Handout # 5 P vs. NP We consider the possible relationships among the classes P, NP, and co-np. First we consider properties of the class of NP-complete problems, as opposed to those which are
More information