Circuit depth relative to a random oracle. Peter Bro Miltersen. Aarhus University, Computer Science Department
|
|
- Millicent Anthony
- 5 years ago
- Views:
Transcription
1 Circuit depth relative to a random oracle Peter Bro Miltersen Aarhus University, Computer Science Department Ny Munkegade, DK 8000 Aarhus C, Denmark. pbmiltersen@daimi.aau.dk Keywords: Computational complexity, random oracles, circuit depth. Introduction The study of separation of complexity classes with respect to random oracles was initiated by Bennett and Gill [1] and continued by many researchers. Computation relative to an oracle A, where A f0; 1g is a computation which is allowed to ask queries of the form y A? and get answers. A random oracle A is simply a random (with respect to Lebesgue measure) subset of f0; 1g, i.e. for each x f0; 1g, x A with probability 1 and all these events are mutually independent. Wilson [6, 7] dened relativized circuit depth and constructed various oracles A for which P A 6= NC A, NC A k 6= NC A k+ ; ACA k 6= AC A k+ ; ACA k 6 NC A k+1? and NC A k 6 AC A k? for all positive rational k and, thus separating those classes for which no trivial argument shows inclusion (the denition of NC A k and AC A k is restricted to rational k for constructibility reasons). In this note we show that as a consequence of a single lemma, these separations (or improvements of them) hold with respect to a random oracle A with probability 1. This research was partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract No (project ALCOM). 1
2 The results Let = f0; 1g and let log n denote log n. Recall the following denitions by Wilson [5, 6, 7]. Denition 1 A bounded fan-in oracle circuit C is a circuit containing negation gates of indegree 1, AND and OR gates of indegree as well as unspecied oracle gates of various indegrees, giving a single Boolean output. Given an oracle A, i.e. a subset of, C A denotes the circuit, where each oracle gate of indegree m in C has been replaced by a gate computing A : m!, where A (x) is 1 if x A and 0 otherwise. The depth of an oracle gate with m inputs is dlog me. The size of an oracle gate with m inputs is m? 1. Boolean gates have size and depth 1. The size of an oracle circuit is the sum of the sizes of its gates. The depth of a path in a circuit is the sum of the depths of the gates along the path. The depth of a circuit is the depth of its deepest path. Denition An unbounded fan-in oracle circuit C is dened as in the bounded fan-in case, except that and and or gates of arbitrary indegree are allowed, and each oracle gate is only charged depth 1. The depth of an unbounded fan-in circuit is thus simply the length of its longest path. Denition 3 DEPTH A i.o. (d) is the class of functions f so that for innitely many integers n a bounded fan-in oracle circuit C n with n inputs of depth at most d exists so that C A(x) = f(x) for all n x n, where C A n (x) denotes the output of Cn A when x is given as input. Let k be a positive rational number. NC A k is the class of functions f for which a logspace-uniform family of polynomial size, O(log k n)-depth bounded fan-in circuits C n with n inputs exists so that Cn A (x) = f(x). AC A k is the class of functions f for which a logspace-uniform family of polynomial size, O(log k n)-depth unbounded fan-in circuits C n with n inputs exists so that Cn A (x) = f(x). Let A be an oracle. Let t n 1 ; : : : ; tn n be the n lexicographically rst strings of length dlog ne. Let f A n : f0; 1gn! f0; 1g n be the function f A n (x) = A (xt n 1 ) A(xt n ) : : : A(xt n n ). Lemma 4 Let n and d be positive integers. Let C be a xed oracle circuit with n Boolean inputs and n Boolean outputs containing at most s =
3 n? log d?5 oracle gates of indegree exactly n + dlog ne so that no path in C contains more than d oracle gates of indegree exactly n + dlog ne (no restriction is made on gates of other indegrees). Then, for a random oracle A, the probability that C A computes (fn A ) d+1, i.e. the composition of fn A with itself d + 1 times, is at most? n. Proof Let us call the oracle gates of indegree n + dlog ne interesting. We partition the gates of C into d levels 0; 1; : : : ; d? 1, such that no path exists from the output of any interesting gate at level i to the input of any interesting gate at level j if j i. The idea of the proof is to show that with high probability, (fn A ) i+1 (x) is not computed before level i. Given an oracle A and a vector x n, let Ix A (i) denote the set of strings y for which some string t of length dlog ne exists, so that yt is given as input to some interesting gate at level i, when C A is given x as an input. For convenience, let I A(d) = x fc A (x)g. Consider the following procedure for nding a string x such that C A (x) 6= (fn A ) d+1 (x). 1. L := ;.. if n L then report failure and stop, we were not successful. 3. select any x n n L. 4. x 0 := x. 5. for i := 0 to d do 6. compute I A x (i) by simulating the necessary parts of the circuit. 7. L := L [ I A x (i) [ fx i g. 8. x i+1 := f A n (x i). 9. if x i+1 L then goto. 10. od. 11. return x. 3
4 Let us rst observe that the protocol indeed returns a string with the desired property in case it does not fail. This is so, because x d+1 = (fn A ) d+1 (x), and the algorithm makes sure that x d+1 6 L at a time when Ix A (d) L and by denition C A (x) Ix A (d). Let us then estimate the probability of failure. We will rst give an upper bound on the probability of leaving the for-loop at line 9. For convenience, let us assume that the membership of a string in A is not determined until the algorithm asks for it. It is easy to see that the protocol makes sure that no bit of the value of fn A (x i ) has been determined previous to line 8. Hence, all n values are equally likely. Of these values, jlj of them cause the algorithm to leave the for-loop in the next line. Hence, each time line 9 is encountered, the probability of leaving the loop is exactly jlj. If we assume that n m values of x have been tried so far (including the current value), an upper bound of this is m(s+d+1) 3dms. n n Thus, each time the for-loop is executed, an upper bound of the probability of leaving it prematurely is (d + 1) 3dms n 6d ms. Since the algorithm will n try dierent values of x at least until this upper bound is 1 and the above argument applies to all of them, we have Pr(failure) b n 6d Y s c m=1 6d ms n : The factors in this product are increasing, so we get for any positive integer k b n 6d s c: Pr(failure) ( 6d ks n ) k : Putting k = d n e, we get: Pr(failure)? n : Theorem 5 For < 1, PA 6 DEPTH A i.o. (n) for a random oracle A with probability 1. Proof Let d n = bnc. The family of functions g A n = (f A n ) dn+1 is clearly in P A. Fix n and let C be a xed bounded fan-in oracle circuit of depth d n. It is easy to see that the size of C is at most dn, so by Lemma 4, the 4
5 probability that C A computes gn A is at most? n. An oracle circuit of size s n can be described as a straight line program in a nite alphabet using O(s log s) letters. There are thus at most O(s log s) oracle circuits of size s and therefore at most dn+o(dn ) bounded fan-in oracle circuits of depth d n, so the probability that some such circuit computes gn A with A as oracle is at most n+o(n)? n which is less than?n for suciently large n. If a function is computed by a circuit of depth at most n, it is also computed by a circuit of depth bnc, since depths are integers. Thus, for suciently large N, the probability that for some P n greater than N, gn A has A-circuits of depth at 1 most n, is at most n=n?n =?N +1. The probability that for all N, an integer n greater than N exists such that gn A has circuits of depth at most n, is thus at most inf N?N +1 = 0. The theorem is an improvement of Wilson's result [6] that oracles A exists such that P A 6= NC A. Since every function has unrelativized depth at most n + o(n), the result is optimal, up to a multiplicative constant of +. Similar results about circuit size were obtained by Lutz and Schmidt [4] who showed that for small and a random oracle A, NP A 6 SIZE A i.o. (n ) and by Kurtz, Mahaney and Royer [3], who proved NP A 6 co-nsize A i.o. (n ), where co-nsize A i.o. (n ) is the class of functions whose negations are computed by nondeterministic A-circuits of size n. Theorem 6 For rational k 0 and > 0, AC A k 6 NC A k+1? for random A with probability 1. Proof Let d n = blog k nc and gn A = (fn A ) dn+1. gn A is in AC A k. It is sucient to prove that with probability 1, g A n is not computed by a family of bounded fan-in circuits C n of depth O(log k+1? n). Fix n and a circuit C n within this bound. Since C n can not contain a path with more than O(log k? n) oracle gates of indegree n + dlog ne and since it has size at most logo(1) n, it satises the conditions of Lemma 4. Thus, the probability that Cn A computes gn A is at most? n. Now proceed as in the previous proof. From the proof we see that we actually get the stronger result that there are functions in AC A k which can not be computed in depth o(log k+1 n) by bounded fan-in A-circuits for random A with probability 1. 5
6 Theorem 7 For rational k > 0 and > 0, NC A 6 k ACA k? for random A with probability 1. Proof The proof is based upon the idea behind the corresponding oracle construction by Wilson [7]. Let d n = b logk n c, log log n m n = dlog ne and let gn A (x 1 x : : : x n ) = (fm A n ) dn+1 (x 1 x : : : x mn ). gn A is in NC A k, since we are only charged depth O(log log n) for computing fm A n. The probability that gn A is computed by a specic circuit of size O(n l ), depth O(log k? n), even with mn log n unbounded fan-in, is, by Lemma 4, at most??n. Now proceed as in the previous proofs. The proof actually gives us functions in NC A k which require superpolynomial size to be computed in depth o(log k n= log log n) with unbounded fan-in A-circuits for random A with probability 1. This is optimal, since standard techniques provide a simulation of NC A k by polynomial size, depth O(log k n= log log n), unbounded fan-in A-circuits for any oracle A []. From the fact that NC A 6 k+ ACA k for random A with probability 1, we get the following corollary. Corollary 8 For rational k 0 and > 0, NC A k 6= NC A k+ and AC A k 6= AC A k+ for random A with probability 1. References [1] C.H. Bennett and J. Gill: Relative to a random oracle A, P A 6= NP A 6= co-np A with probability 1, SIAM J. Comput. 10 (1981) [] A.K. Chandra, L. Stockmeyer and U. Vishkin, Constant depth reducibility, SIAM J. Comput. 13 (1984) [3] S. Kurtz, S. Mahaney and J. Royer, Average dependence and random oracles, Tech. Rept. SU-CIS-91-03, School of Computer and Information Science, Syracuse University, January [4] J.H. Lutz and W.J. Schmidt, Circuit size relative to pseudorandom oracles, in: Proc. 5th Structure in Complexity Theory Conference (IEEE 6
7 Press, 1990) Errata in: Proc. 6th Structure in Complexity Theory Conference (IEEE Press, 1991) 39. [5] C.B. Wilson, Relativized circuit complexity, J. Comput. System Sci. 31 (1985) [6] C.B. Wilson, Relativized NC, Math. Systems Theory 0 (1987) [7] C.B. Wilson, On the decomposability of NC and AC, SIAM J. Comput. 19 (1990)
Relativized 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 informationNew concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space
Lesson 6: Linear independence, matrix column space and null space New concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space Two linear systems:
More informationThen RAND RAND(pspace), so (1.1) and (1.2) together immediately give the random oracle characterization BPP = fa j (8B 2 RAND) A 2 P(B)g: (1:3) Since
A Note on Independent Random Oracles Jack H. Lutz Department of Computer Science Iowa State University Ames, IA 50011 Abstract It is shown that P(A) \ P(B) = BPP holds for every A B. algorithmically random
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 informationOn Languages with Very High Information Content
Computer Science Technical Reports Computer Science 5-1992 On Languages with Very High Information Content Ronald V. Book University of California, Santa Barbara Jack H. Lutz Iowa State University, lutz@iastate.edu
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 informationCounting and Constructing Minimal Spanning Trees. Perrin Wright. Department of Mathematics. Florida State University. Tallahassee, FL
Counting and Constructing Minimal Spanning Trees Perrin Wright Department of Mathematics Florida State University Tallahassee, FL 32306-3027 Abstract. We revisit the minimal spanning tree problem in order
More information2. THE MAIN RESULTS In the following, we denote by the underlying order of the lattice and by the associated Mobius function. Further let z := fx 2 :
COMMUNICATION COMLEITY IN LATTICES Rudolf Ahlswede, Ning Cai, and Ulrich Tamm Department of Mathematics University of Bielefeld.O. Box 100131 W-4800 Bielefeld Germany 1. INTRODUCTION Let denote a nite
More informationcase in mathematics and Science, disposing of an auxiliary condition that is not well-understood (i.e., uniformity) may turn out fruitful. In particul
Texts in Computational Complexity: P/poly and PH Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Rehovot, Israel. November 28, 2005 Summary: We consider
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationJack H. Lutz. Iowa State University. Abstract. It is shown that almost every language in ESPACE is very hard to
An Upward Measure Separation Theorem Jack H. Lutz Department of Computer Science Iowa State University Ames, IA 50011 Abstract It is shown that almost every language in ESPACE is very hard to approximate
More informationReductions to Graph Isomorphism
Reductions to raph Isomorphism Jacobo Torán Institut für Theoretische Informatik Universität Ulm D-89069 Ulm, ermany jacobo.toran@uni-ulm.de June 13, 2008 Keywords: Computational complexity, reducibilities,
More informationA version of for which ZFC can not predict a single bit Robert M. Solovay May 16, Introduction In [2], Chaitin introd
CDMTCS Research Report Series A Version of for which ZFC can not Predict a Single Bit Robert M. Solovay University of California at Berkeley CDMTCS-104 May 1999 Centre for Discrete Mathematics and Theoretical
More informationUpper and Lower Bounds on the Number of Faults. a System Can Withstand Without Repairs. Cambridge, MA 02139
Upper and Lower Bounds on the Number of Faults a System Can Withstand Without Repairs Michel Goemans y Nancy Lynch z Isaac Saias x Laboratory for Computer Science Massachusetts Institute of Technology
More informationCS 151 Complexity Theory Spring Solution Set 5
CS 151 Complexity Theory Spring 2017 Solution Set 5 Posted: May 17 Chris Umans 1. We are given a Boolean circuit C on n variables x 1, x 2,..., x n with m, and gates. Our 3-CNF formula will have m auxiliary
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 informationPreface These notes were prepared on the occasion of giving a guest lecture in David Harel's class on Advanced Topics in Computability. David's reques
Two Lectures on Advanced Topics in Computability Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. oded@wisdom.weizmann.ac.il Spring 2002 Abstract This text consists
More informationHard Sets Are Hard to Find. H. Buhrman D. van Melkebeek y GB Amsterdam The University of Chicago
Hard Sets Are Hard to Find H. Buhrman D. van Melkebeek y CWI Fields Institute & PO Box 94079 Department of Computer Science 1090 GB Amsterdam The University of Chicago The Netherlands Chicago, IL 60637,
More informationRecognizing Tautology by a Deterministic Algorithm Whose While-loop s Execution Time Is Bounded by Forcing. Toshio Suzuki
Recognizing Tautology by a Deterministic Algorithm Whose While-loop s Execution Time Is Bounded by Forcing Toshio Suzui Osaa Prefecture University Saai, Osaa 599-8531, Japan suzui@mi.cias.osaafu-u.ac.jp
More information: On the P vs. BPP problem. 18/12/16 Lecture 10
03684155: On the P vs. BPP problem. 18/12/16 Lecture 10 Natural proofs Amnon Ta-Shma and Dean Doron 1 Natural proofs The ultimate goal we have is separating classes (or proving they are equal if they are).
More information, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor, Michigan
SIAM J. COMPUT. Vol. 13, No. 4, November 1984 (C) 1984 Society for Industrial and Applied Mathematics 002 EQUIVALENCE RELATIONS, INVARIANTS, AND NORMAL FORMS* ANDREAS BLASS" AND YURI GUREVICH* Abstract.
More informationNotes on Computer Theory Last updated: November, Circuits
Notes on Computer Theory Last updated: November, 2015 Circuits Notes by Jonathan Katz, lightly edited by Dov Gordon. 1 Circuits Boolean circuits offer an alternate model of computation: a non-uniform one
More information1. Introduction Symmetric functions form an important subclass of Boolean functions including all kinds of counting functions. A Boolean function f :
OPTIMAL DEPTH, VERY SMALL SIZE CIRCUITS FOR SYMMETRIC FUNCTIONS IN AC 0 Johan Hastad, Royal Institute of Technology 10044 Stockholm, Sweden and Ingo Wegener, Norbert Wurm and Sang-Zin Yi FB Informatik,
More informationLower Bounds for Cutting Planes Proofs. with Small Coecients. Abstract. We consider small-weight Cutting Planes (CP ) proofs; that is,
Lower Bounds for Cutting Planes Proofs with Small Coecients Maria Bonet y Toniann Pitassi z Ran Raz x Abstract We consider small-weight Cutting Planes (CP ) proofs; that is, Cutting Planes (CP ) proofs
More informationIBM Almaden Research Center, 650 Harry Road, School of Mathematical Sciences, Tel Aviv University, TelAviv, Israel
On the Complexity of Some Geometric Problems in Unbounded Dimension NIMROD MEGIDDO IBM Almaden Research Center, 650 Harry Road, San Jose, California 95120-6099, and School of Mathematical Sciences, Tel
More informationThe Random Oracle Hypothesis is False. Pankaj Rohatgi 1. July 6, Abstract
The Random Oracle Hypothesis is False Richard Chang 1;2 Benny Chor ;4 Oded Goldreich ;5 Juris Hartmanis 1 Johan Hastad 6 Desh Ranjan 1;7 Pankaj Rohatgi 1 July 6, 1992 Abstract The Random Oracle Hypothesis,
More informationa cell is represented by a triple of non-negative integers). The next state of a cell is determined by the present states of the right part of the lef
MFCS'98 Satellite Workshop on Cellular Automata August 25, 27, 1998, Brno, Czech Republic Number-Conserving Reversible Cellular Automata and Their Computation-Universality Kenichi MORITA, and Katsunobu
More information1 Preliminaries We recall basic denitions. A deterministic branching program P for computing a Boolean function h n : f0; 1g n! f0; 1g is a directed a
Some Separation Problems on Randomized OBDDs Marek Karpinski Rustam Mubarakzjanov y Abstract We investigate the relationships between complexity classes of Boolean functions that are computable by polynomial
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 informationPortland, ME 04103, USA IL 60637, USA. Abstract. Buhrman and Torenvliet created an oracle relative to which
Beyond P NP = NEXP Stephen A. Fenner 1? and Lance J. Fortnow 2?? 1 University of Southern Maine, Department of Computer Science 96 Falmouth St., Portland, ME 04103, USA E-mail: fenner@usm.maine.edu, Fax:
More informationReducing P to a Sparse Set using a Constant Number of Queries. Collapses P to L. Dieter van Melkebeek. The University of Chicago.
Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L Dieter van Melkebeek Department of Computer Science The University of Chicago Chicago, IL 60637 Abstract We prove that there
More informationOn the P versus NP intersected with co-np question in communication complexity
On the P versus NP intersected with co-np question in communication complexity Stasys Jukna Abstract We consider the analog of the P versus NP co-np question for the classical two-party communication protocols
More informationLecture 14 - P v.s. NP 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 27, 2018 Lecture 14 - P v.s. NP 1 In this lecture we start Unit 3 on NP-hardness and approximation
More informationComputer Science Dept.
A NOTE ON COMPUTATIONAL INDISTINGUISHABILITY 1 Oded Goldreich Computer Science Dept. Technion, Haifa, Israel ABSTRACT We show that following two conditions are equivalent: 1) The existence of pseudorandom
More information1 Introduction A general problem that arises in dierent areas of computer science is the following combination problem: given two structures or theori
Combining Unication- and Disunication Algorithms Tractable and Intractable Instances Klaus U. Schulz CIS, University of Munich Oettingenstr. 67 80538 Munchen, Germany e-mail: schulz@cis.uni-muenchen.de
More informationRelative to a Random Oracle, NP Is Not Small. Steven M. Kautz. Department of Mathematics. Randolph-Macon Woman's College Rivermont Avenue
Relative to a Random Oracle, NP Is Not Small Steven M. Kautz Department of Mathematics Randolph-Macon Woman's College 2500 Rivermont Avenue Lynchburg, VA 24503 Peter Bro Miltersen y Department of Computer
More informationNick Reingold y Daniel Spielman z. Abstract. In his seminal paper on probabilistic Turing machines, Gill [13] asked
PP is Closed Under Intersection Richard Beigel y Yale University Nick Reingold y Yale University Daniel Spielman z Yale College Abstract In his seminal paper on probabilistic Turing machines, Gill [13]
More informationOn Controllability and Normality of Discrete Event. Dynamical Systems. Ratnesh Kumar Vijay Garg Steven I. Marcus
On Controllability and Normality of Discrete Event Dynamical Systems Ratnesh Kumar Vijay Garg Steven I. Marcus Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin,
More informationComputational Complexity: Problem Set 4
Computational Complexity: Problem Set 4 Due: Friday January 8, 16, at 3:59 AoE. Submit your solutions as a PDF le by e-mail to jakobn at kth dot se with the subject line Problem set 4: your full name.
More informationExtracted from a working draft of Goldreich s FOUNDATIONS OF CRYPTOGRAPHY. See copyright notice.
106 CHAPTER 3. PSEUDORANDOM GENERATORS Using the ideas presented in the proofs of Propositions 3.5.3 and 3.5.9, one can show that if the n 3 -bit to l(n 3 ) + 1-bit function used in Construction 3.5.2
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 informationOn Reductions of P Sets to Sparse Sets. Dieter van Melkebeek. The University of Chicago. June 18, Abstract
On Reductions of P Sets to Sparse Sets Dieter van Melkebeek The University of Chicago June 18, 1995 Abstract We prove unlikely consequences of the existence of sparse hard sets for P under deterministic
More informationLecture Notes Each circuit agrees with M on inputs of length equal to its index, i.e. n, x {0, 1} n, C n (x) = M(x).
CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 4 February 3, 2010 Scribe: Jonathan Pines 1 Agenda P-/NP- Completeness NP-intermediate problems NP vs. co-np L, NL 2 Recap Last time, we
More informationA Hierarchy Based on Output Multiplicity
A Hierarchy Based on Output Multiplicity Ashish V. Naik Chronologic Simulation John D. Rogers DePaul University Alan L. Selman University at Buffalo October 21, 1997 James S. Royer Syracuse University
More informationLecture 20: conp and Friends, Oracles in Complexity Theory
6.045 Lecture 20: conp and Friends, Oracles in Complexity Theory 1 Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode:
More informationLecture 9 : PPAD and the Complexity of Equilibrium Computation. 1 Complexity Class PPAD. 1.1 What does PPAD mean?
CS 599: Algorithmic Game Theory October 20, 2010 Lecture 9 : PPAD and the Complexity of Equilibrium Computation Prof. Xi Chen Scribes: Cheng Lu and Sasank Vijayan 1 Complexity Class PPAD 1.1 What does
More informationCounting the number of solutions. A survey of recent inclusion results in the area of counting classes. Jacobo Toran* Departament L.S.I.
Counting the number of solutions A survey of recent inclusion results in the area of counting classes 1. Introduction Jacobo Toran* Departament L.S.I. U. Politecnica de Catalunya Pau Gargallo 5 08028 Barcelona,
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 information1 Circuit Complexity. CS 6743 Lecture 15 1 Fall Definitions
CS 6743 Lecture 15 1 Fall 2007 1 Circuit Complexity 1.1 Definitions A Boolean circuit C on n inputs x 1,..., x n is a directed acyclic graph (DAG) with n nodes of in-degree 0 (the inputs x 1,..., x n ),
More informationAn Implementation of Ecient Pseudo-Random Functions. Michael Langberg. March 25, Abstract
An Implementation of Ecient Pseudo-Random Functions Michael Langberg March 5, 1998 Abstract Naor and Reingold [3] have recently introduced two new constructions of very ecient pseudo-random functions,
More informationOn-line Bin-Stretching. Yossi Azar y Oded Regev z. Abstract. We are given a sequence of items that can be packed into m unit size bins.
On-line Bin-Stretching Yossi Azar y Oded Regev z Abstract We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try
More informationAnalog Neural Nets with Gaussian or other Common. Noise Distributions cannot Recognize Arbitrary. Regular Languages.
Analog Neural Nets with Gaussian or other Common Noise Distributions cannot Recognize Arbitrary Regular Languages Wolfgang Maass Inst. for Theoretical Computer Science, Technische Universitat Graz Klosterwiesgasse
More informationBasic Proof Techniques
Basic Proof Techniques Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 Basic Notation The following is standard notation for proofs: A B. A implies B. A B.
More informationNotes on Iterated Expectations Stephen Morris February 2002
Notes on Iterated Expectations Stephen Morris February 2002 1. Introduction Consider the following sequence of numbers. Individual 1's expectation of random variable X; individual 2's expectation of individual
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More informationOn the power of real Turing machines. over binary inputs. Felipe Cucker. Universitat Pompeu Fabra. Balmes 132, Barcelona SPAIN
On the power of real Turing machines over binary inputs Felipe Cucker Universitat Pompeu Fabra Balmes 13, Barcelona 08008 SPAIN e-mail: cucker@upf.es Dima Grigoriev y Depts. of Comp. Science and Mathematics
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 information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationmeasure 0 in EXP (in fact, this result is established for any set having innitely many hard instances, in the Instant Complexity sense). As a conseque
An Excursion to the Kolmogorov Random Strings Harry uhrman Elvira Mayordomo y CWI, PO ox 94079 Dept. Informatica 1090 G Amsterdam, Univ. de Zaragoza The Netherlands 50015 Zaragoza, Spain buhrman@cwi.nl
More informationChapter 1. Comparison-Sorting and Selecting in. Totally Monotone Matrices. totally monotone matrices can be found in [4], [5], [9],
Chapter 1 Comparison-Sorting and Selecting in Totally Monotone Matrices Noga Alon Yossi Azar y Abstract An mn matrix A is called totally monotone if for all i 1 < i 2 and j 1 < j 2, A[i 1; j 1] > A[i 1;
More informationDD2446 Complexity Theory: Problem Set 4
DD2446 Complexity Theory: Problem Set 4 Due: Friday November 8, 2013, at 23:59. Submit your solutions as a PDF le by e-mail to jakobn at kth dot se with the subject line Problem set 4: your full name.
More informationThe bit probe complexity measure revisited
The bit probe complexity measure revisited Peter Bro Miltersen May 1992 Abstract The bit probe complexity of a static data structure problem within a given size bound was defined by Elias and Flower. It
More informationThe Complexity of the Comparator Circuit Value Problem
The Complexity of the Comparator Circuit Value Problem Stephen Cook Joint work with Yuval Filmus and Dai Tri Man Lê Department of Computer Science University of Toronto Canada Banff 2013 1 / 28 Outline
More informationof membership contain the same amount of information? With respect to (1), Chen and Toda [CT93] showed many functions to be complete for FP NP (see al
On Functions Computable with Nonadaptive Queries to NP Harry Buhrman Jim Kadin y Thomas Thierauf z Abstract We study FP NP, the class of functions that can be computed with nonadaptive queries to an NP
More informationThe best expert versus the smartest algorithm
Theoretical Computer Science 34 004 361 380 www.elsevier.com/locate/tcs The best expert versus the smartest algorithm Peter Chen a, Guoli Ding b; a Department of Computer Science, Louisiana State University,
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 information2 PAVEL PUDLAK AND JIRI SGALL may lead to a monotone model of computation, which makes it possible to use available lower bounds for monotone models o
Algebraic models of computation and interpolation for algebraic proof systems Pavel Pudlak and Jir Sgall 1. Introduction We consider some algebraic models used in circuit complexity theory and in the study
More informationLearning Large-Alphabet and Analog Circuits with Value Injection Queries
Learning Large-Alphabet and Analog Circuits with Value Injection Queries Dana Angluin 1 James Aspnes 1, Jiang Chen 2, Lev Reyzin 1,, 1 Computer Science Department, Yale University {angluin,aspnes}@cs.yale.edu,
More informationContents 1 Introduction Objects, specications, and implementations : : : : : : : : : : : : : : : : : : : : : : : : : : : : Indistinguishab
On the Implementation of Huge Random Objects Oded Goldreich y Sha Goldwasser yz Asaf Nussboim y December 15, 2007 Abstract We initiate a general study of the feasibility of implementing (huge) random objects,
More informationOn the Power of Multi-Prover Interactive Protocols. Lance Fortnow. John Rompel y. Michael Sipser z. Massachusetts Institute of Technology
On the Power of Multi-Prover Interactive Protocols Lance Fortnow John Rompel y Michael Sipser z { Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, MA 02139 1 Introduction
More informationCSC 5170: Theory of Computational Complexity Lecture 9 The Chinese University of Hong Kong 15 March 2010
CSC 5170: Theory of Computational Complexity Lecture 9 The Chinese University of Hong Kong 15 March 2010 We now embark on a study of computational classes that are more general than NP. As these classes
More informationContents 1 Introduction 2 2 Formal Setting and General Observations Specication : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
On the Implementation of Huge Random Objects (Preliminary Version) Oded Goldreich y Sha Goldwasser yz Asaf Nussboim June 8, 2003 Abstract We initiate a general study of pseudo-random implementations of
More informationINDEPENDENCE OF THE CONTINUUM HYPOTHESIS
INDEPENDENCE OF THE CONTINUUM HYPOTHESIS CAPSTONE MATT LUTHER 1 INDEPENDENCE OF THE CONTINUUM HYPOTHESIS 2 1. Introduction This paper will summarize many of the ideas from logic and set theory that are
More informationThe Complexity of Finite Functions. Ravi B. Boppana * New York University. New York, NY Michael Sipser ** August 1989
The Complexity of Finite Functions Ravi B. Boppana * Department of Computer Science New York University New York, NY 10012 Michael Sipser ** Mathematics Department Massachusetts Institute of Technology
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 informationThe Isomorphism Conjecture Fails Relative to a Random Oracle
Syracuse University SURFACE Electrical Engineering and Computer Science College of Engineering and Computer Science 1996 The Isomorphism Conjecture Fails Relative to a Random Oracle Stuart A. Kurtz University
More informationCoins with arbitrary weights. Abstract. Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to
Coins with arbitrary weights Noga Alon Dmitry N. Kozlov y Abstract Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to decide if all the m given coins have the
More informationOn the complexity of approximate multivariate integration
On the complexity of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 USA ioannis.koutis@cs.cmu.edu January 11, 2005 Abstract
More informationgrowth rates of perturbed time-varying linear systems, [14]. For this setup it is also necessary to study discrete-time systems with a transition map
Remarks on universal nonsingular controls for discrete-time systems Eduardo D. Sontag a and Fabian R. Wirth b;1 a Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, b sontag@hilbert.rutgers.edu
More informationNP-completeness. Chapter 34. Sergey Bereg
NP-completeness Chapter 34 Sergey Bereg Oct 2017 Examples Some problems admit polynomial time algorithms, i.e. O(n k ) running time where n is the input size. We will study a class of NP-complete problems
More informationA fast algorithm to generate necklaces with xed content
Theoretical Computer Science 301 (003) 477 489 www.elsevier.com/locate/tcs Note A fast algorithm to generate necklaces with xed content Joe Sawada 1 Department of Computer Science, University of Toronto,
More informationOn Probabilistic ACC Circuits. with an Exact-Threshold Output Gate. Richard Beigel. Department of Computer Science, Yale University
On Probabilistic ACC Circuits with an Exact-Threshold Output Gate Richard Beigel Department of Computer Science, Yale University New Haven, CT 06520-2158, USA. beigel-richard@cs.yale.edu Jun Tarui y Department
More informationLecture 5: The Landscape of Complexity Classes
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 5: The Landscape of Complexity Classes David Mix Barrington and Alexis Maciel July 21,
More informationLecture 15 - NP Completeness 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 29, 2018 Lecture 15 - NP Completeness 1 In the last lecture we discussed how to provide
More informationON TRANSCENDENTAL NUMBERS GENERATED BY CERTAIN INTEGER SEQUENCES
iauliai Math. Semin., 8 (16), 2013, 6369 ON TRANSCENDENTAL NUMBERS GENERATED BY CERTAIN INTEGER SEQUENCES Soichi IKEDA, Kaneaki MATSUOKA Graduate School of Mathematics, Nagoya University, Furocho, Chikusaku,
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 informationThe Complexity and Proof Complexity of the Comparator Circuit Value Problem
The Complexity and Proof Complexity of the Comparator Circuit Value Problem Stephen Cook Joint work with Yuval Filmus, Dai Tri Man Lê, and Yuli Ye Department of Computer Science University of Toronto Canada
More informationStanford University CS254: Computational Complexity Handout 8 Luca Trevisan 4/21/2010
Stanford University CS254: Computational Complexity Handout 8 Luca Trevisan 4/2/200 Counting Problems Today we describe counting problems and the class #P that they define, and we show that every counting
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 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 informationInteger Circuit Evaluation is PSPACE-complete. Ke Yang. Computer Science Department, Carnegie Mellon University, 5000 Forbes Ave.
Integer Circuit Evaluation is PSPACE-complete Ke Yang Computer Science Department, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA 15213, USA E-mail: yangke@cmu.edu Key Words: PSPACE, Integer
More informationDeterministic Approximation Algorithms for the Nearest Codeword Problem
Deterministic Approximation Algorithms for the Nearest Codeword Problem Noga Alon 1,, Rina Panigrahy 2, and Sergey Yekhanin 3 1 Tel Aviv University, Institute for Advanced Study, Microsoft Israel nogaa@tau.ac.il
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 information1 More concise proof of part (a) of the monotone convergence theorem.
Math 0450 Honors intro to analysis Spring, 009 More concise proof of part (a) of the monotone convergence theorem. Theorem If (x n ) is a monotone and bounded sequence, then lim (x n ) exists. Proof. (a)
More information1 The Low-Degree Testing Assumption
Advanced Complexity Theory Spring 2016 Lecture 17: PCP with Polylogarithmic Queries and Sum Check Prof. Dana Moshkovitz Scribes: Dana Moshkovitz & Michael Forbes Scribe Date: Fall 2010 In this lecture
More informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More informationBaire categories on small complexity classes and meager comeager laws
Information and Computation 206 (2008) 15 33 www.elsevier.com/locate/ic Baire categories on small complexity classes and meager comeager laws Philippe Moser Department of Computer Science, National University
More informationNon-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. Eric Allender y. Department of Computer Science. Rutgers University
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds Eric Allender y Department of Computer Science Rutgers University Hill Center, Busch Campus, P.O. Box 1179 Piscataway, NJ 08855-1179,
More information4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial
Linear Algebra (part 4): Eigenvalues, Diagonalization, and the Jordan Form (by Evan Dummit, 27, v ) Contents 4 Eigenvalues, Diagonalization, and the Jordan Canonical Form 4 Eigenvalues, Eigenvectors, and
More information1 Introduction This work follows a paper by P. Shields [1] concerned with a problem of a relation between the entropy rate of a nite-valued stationary
Prexes and the Entropy Rate for Long-Range Sources Ioannis Kontoyiannis Information Systems Laboratory, Electrical Engineering, Stanford University. Yurii M. Suhov Statistical Laboratory, Pure Math. &
More information