The Complexity Zoo

[1]  Hans Heller,et al.  Relativized polynomial hierarchies extending two levels , 1984, Mathematical systems theory.

[2]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[3]  Michael I. Dekhtyar,et al.  On the Relativization of Deterministic and Nondeterministic Complexity Classes , 1976, MFCS.

[4]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[5]  Ketan Mulmuley,et al.  Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems , 2002, SIAM J. Comput..

[6]  Cristopher Moore.  Quantum Circuits: Fanout, Parity, and Counting , 1999, Electron. Colloquium Comput. Complex..

[7]  Jacobo Torán,et al.  On the hardness of graph isomorphism , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[8]  Jörg Rothe,et al.  Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP , 1997, JACM.

[9]  Burkhard Monien.  On a Subclass of Pseudopolynomial Problems , 1980, MFCS.

[10]  R. Cleve,et al.  Consequences and limits of nonlocal strategies , 2004 .

[11]  Lide Li.  On the Counting Functions , 1993 .

[12]  Christos H. Papadimitriou,et al.  Games against nature , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[13]  Christos H. Papadimitriou,et al.  Reversible Simulation of Space-Bounded Computations , 1995, Theor. Comput. Sci..

[14]  Pierre McKenzie,et al.  On the complexity of some problems on groups input as multiplication tables , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[15]  Juris Hartmanis.  Collapsing Hierarchies , 1993, Current Trends in Theoretical Computer Science.

[16]  Joshua Buresh-Oppenheim,et al.  Relativized NP search problems and propositional proof systems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[17]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[18]  Larry Rudolph,et al.  A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..

[19]  Osamu Watanabe,et al.  A Comparison of Polynomial Time Completeness Notions , 1987, Theor. Comput. Sci..

[20]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[21]  Jin-Yi Cai,et al.  On the Power of Parity Polynomial Time , 1989, STACS.

[22]  Christian Glaßer,et al.  A Protocol for Serializing Unique Strategies , 2004, MFCS.

[23]  Wim van Dam,et al.  Quantum Algorithms for Hidden Coset ProblemsWim , 2001 .

[24]  Dexter Kozen.  On the Myhill-Nerode Theorem for Trees , 1992 .

[25]  Michael Sipser,et al.  On Relativization and the Existence of Complete Sets , 1982, ICALP.

[26]  Gerd Wechsung,et al.  On the Power of Probabilistic Polynomial Time: (extended abstract) , 1989 .

[27]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[28]  James Aspnes,et al.  The expressive power of voting polynomials , 1994, Comb..

[29]  John Watrous,et al.  Space-Bounded Quantum Complexity , 1999, J. Comput. Syst. Sci..

[30]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[31]  Marek Karpinski,et al.  On the Power of Randomized Ordered Branching Programs , 1998, Electron. Colloquium Comput. Complex..

[32]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[33]  Peter Bürgisser,et al.  Completeness and Reduction in Algebraic Complexity Theory , 2000, Algorithms and computation in mathematics.

[34]  E. Kushilevitz,et al.  Cryptography in NC/sup 0/ , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[35]  Andrew Chiu,et al.  Division in logspace-uniform NC1 , 2001, RAIRO Theor. Informatics Appl..

[36]  Kenneth W. Regan.  Understanding the Mulmuley-Sohoni Approach to P vs. NP , 2002, Bull. EATCS.

[37]  Edith Hemaspaandra,et al.  What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses , 1998, SIGA.

[38]  Yehoshua Bar-Hillel,et al.  The Intrinsic Computational Difficulty of Functions , 1969 .

[39]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[40]  Stephen A. Cook,et al.  Deterministic CFL's are accepted simultaneously in polynomial time and log squared space , 1979, STOC.

[41]  Uriel Feige,et al.  On Limited versus Polynomial Nondeterminism , 1997, Chic. J. Theor. Comput. Sci..

[42]  Marek Karpinski,et al.  On real Turing machines that toss coins , 1995, STOC '95.

[43]  Alan L. Selman,et al.  P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP , 1979, Mathematical systems theory.

[44]  Christian Glaßer,et al.  Error-bounded probabilistic computations between MA and AM , 2003, J. Comput. Syst. Sci..

[45]  Oded Goldreich,et al.  Comparing entropies in statistical zero knowledge with applications to the structure of SZK , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[46]  Michael Ben-Or,et al.  Trading Help for Interaction in Statistical Zero-Knowledge Proofs , 2003, Journal of Cryptology.

[47]  Jin-Yi Cai,et al.  With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy , 1986, STOC '86.

[48]  Liming Cai,et al.  On Fixed-Parameter Tractability and Approximability of NP Optimization Problems , 1997, J. Comput. Syst. Sci..

[49]  Juris Hartmanis,et al.  Some Observations about Relativization of Space Bounded Computations , 1988, Current Trends in Theoretical Computer Science.

[50]  Lane A. Hemaspaandra,et al.  A Complexity Theory for Feasible Closure Properties , 1991, J. Comput. Syst. Sci..

[51]  Dorit Aharonov,et al.  A lattice problem in quantum NP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[52]  Ulrich Hertrampf,et al.  Relations Among Mod-Classes , 1990, Theor. Comput. Sci..

[53]  Marek Karpinski,et al.  Simulating Threshold Circuits by Majority Circuits , 1998, SIAM J. Comput..

[54]  Lance Fortnow,et al.  Complexity limitations on quantum computation , 1999, J. Comput. Syst. Sci..

[55]  Hava T. Siegelmann,et al.  A Theory of Complexity for Continuous Time Systems , 2002, J. Complex..

[56]  Stathis Zachos,et al.  Probabilistic Quantifiers and Games , 1988, J. Comput. Syst. Sci..

[57]  Hirotada Kobayashi.  Non-Interactive Quantum Statistical and Perfect Zero-Knowledge Hirotada Kobayashi , 2022 .

[58]  Ronald V. Book.  On Collapsing the Polynomial-Time Hierarchy , 1994, Inf. Process. Lett..

[59]  M. Sipser,et al.  Monotone complexity , 1992 .

[60]  Daniel A. Spielman,et al.  PP is closed under intersection , 1991, STOC '91.

[61]  Carme Àlvarez,et al.  A very hard log space counting class , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[62]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[63]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

[64]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[65]  Masaki Nakanishi,et al.  Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction , 2000, COCOON.

[66]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[67]  Joan Feigenbaum,et al.  Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions , 1993, STOC.

[68]  Gary L. Miller.  Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..

[69]  Sanjay Gupta,et al.  Closure Properties and Witness Reduction , 1995, J. Comput. Syst. Sci..

[70]  Ivan Hal Sudborough,et al.  On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.

[71]  Manuel Blum,et al.  Designing programs that check their work , 1989, STOC '89.

[72]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[73]  C. Papadimitriou,et al.  Two remarks on the power of counting , 1983 .

[74]  Andreas Blass,et al.  On the Unique Satisfiability Problem , 1982, Inf. Control..

[75]  G. Vidal.  Efficient classical simulation of slightly entangled quantum computations. , 2003, Physical review letters.

[76]  Jacobo Torán,et al.  On counting and approximation , 1989, Acta Informatica.

[77]  Christos H. Papadimitriou,et al.  On graph-theoretic lemmata and complexity classes , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[78]  N. V. Vinodchandran,et al.  Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[79]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[80]  Stephen A. Fenner.  PP-Lowness and a Simple Definition of AWPP , 2002, Theory of Computing Systems.

[81]  Thomas Schwentick,et al.  The Power of the Middle Bit of a #P Function , 1995, J. Comput. Syst. Sci..

[82]  Eric Allender,et al.  The complexity of matrix rank and feasible systems of linear equations , 1999, computational complexity.

[83]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[84]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[85]  Christos H. Papadimitriou,et al.  On Total Functions, Existence Theorems and Computational Complexity , 1991, Theor. Comput. Sci..

[86]  A. Church.  The calculi of lambda-conversion , 1941 .

[87]  Rajeev Motwani,et al.  On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[88]  Stathis Zachos,et al.  Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..

[89]  Juris Hartmanis.  Feasible computations and provable complexity properties , 1989, CBMS-NSF regional conference series in applied mathematics.

[90]  Jacobo Torán.  Counting the Number of Solutions , 1990, MFCS.

[91]  Osamu Watanabe,et al.  New Collapse Consequences of NP Having Small Circuits , 1995, ICALP.

[92]  Ker-I Ko,et al.  On Some Natural Complete Operators , 1985, Theor. Comput. Sci..

[93]  Lane A. Hemaspaandra,et al.  Threshold Computation and Cryptographic Security , 1993, ISAAC.

[94]  David Zuckerman.  Simulating BPP using a general weak random source , 2005, Algorithmica.

[95]  Stephen A. Cook,et al.  Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[96]  Allan Borodin,et al.  Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines , 1984, Inf. Control..

[97]  Mihir Bellare,et al.  Knowledge on the average—perfect, statistical and logarithmic , 1995, STOC '95.

[98]  Nikolai K. Vereshchagin,et al.  Banishing Robust Turing Completeness , 1992, LFCS.

[99]  M. B. Plenio,et al.  Efficient factorization with a single pure qubit , 2000 .

[100]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[101]  Leonard M. Adleman,et al.  Quantum Computability , 1997, SIAM J. Comput..

[102]  Heribert Vollmer,et al.  A note on closure properties of logspace MOD classes , 2000, Information Processing Letters.

[103]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[104]  Leonid A. Levin,et al.  No better ways to generate hard NP instances than picking uniformly at random , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[105]  John Gill,et al.  Counting Classes: Thresholds, Parity, Mods, and Fewness , 1990, Theoretical Computer Science.

[106]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[107]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[108]  Samuel R. Buss,et al.  On Truth-Table Reducibility to SAT , 1991, Inf. Comput..

[109]  Harry Buhrman,et al.  Quantum bounded query complexity , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[110]  Howard J. Karloff.  A las vegas rnc algorithm for maximum matching , 1986, Comb..

[111]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[112]  Leslie G. Valiant,et al.  Three problems in computer science , 2003, JACM.

[113]  Ulrich Hertrampf.  Acceptance by transformation monoids (with an application to local self reductions) , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[114]  Yuri Gurevich.  Complete and incomplete randomized NP problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[115]  Vikraman Arvind,et al.  If NP has Polynomial-Size Circuits, then MA=AM , 1995, Theor. Comput. Sci..

[116]  H. Venkateswaran.  Properties that Characterize LOGCFL , 1991, J. Comput. Syst. Sci..

[117]  Peter Bro Miltersen,et al.  Derandomizing Arthur–Merlin Games using Hitting Sets , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[118]  Michael Sipser,et al.  Monotone separation of logspace from NC/sup 1/ , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[119]  Steven Homer,et al.  Oracles for structural properties: the isomorphism problem and public-key cryptography , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[120]  Harumichi Nishimura,et al.  Polynomial time quantum computation with advice , 2003, Inf. Process. Lett..

[121]  Stuart A. Kurtz,et al.  An oracle builder's toolkit , 2003, Inf. Comput..

[122]  Stuart A. Kurtz.  On the Random Oracle Hypothesis , 1983, Inf. Control..

[123]  Michael J. Fischer,et al.  Separating Nondeterministic Time Complexity Classes , 1978, JACM.

[124]  Lance Fortnow,et al.  NP might not be as easy as detecting unique solutions , 1997, STOC '98.

[125]  Andris Ambainis,et al.  On Counting AC0 Circuits with Negative Constants , 1998, MFCS.

[126]  Jin-Yi Cai,et al.  Hardness and hierarchy theorems for probabilistic quasi-polynomial time , 1999, STOC '99.

[127]  Oded Goldreich,et al.  On the theory of average case complexity , 1989, STOC '89.

[128]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..

[129]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..

[130]  Boaz Barak,et al.  A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms , 2002, RANDOM.

[131]  Leslie G. Valiant,et al.  Cryptographic Limitations on Learning Boolean Formulae and Finite Automata , 1993, Machine Learning: From Theory to Applications.

[132]  Carsten Damm,et al.  Problems Complete for +L , 1990, IMYCS.

[133]  Mayur Thakur,et al.  One-way permutations and self-witnessing languages , 2002, J. Comput. Syst. Sci..

[134]  Michael R. Fellows,et al.  Threshold Dominating Sets and an Improved Characterization of W[2] , 1998, Theor. Comput. Sci..

[135]  J. Hartmanis,et al.  Computation Times of NP Sets of Different Densities , 1984, Theor. Comput. Sci..

[136]  Moni Naor,et al.  Number-theoretic constructions of efficient pseudo-random functions , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[137]  Jack H. Lutz,et al.  The Complexity and Distribution of Hard Problems , 1995, SIAM J. Comput..

[138]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[139]  Franz-Josef Brandenburg.  On one-way auxiliary pushdown automata , 1977, Theoretical Computer Science.

[140]  Michael Sipser,et al.  The history and status of the P versus NP question , 1992, STOC '92.

[141]  Mihalis Yannakakis,et al.  On limited nondeterminism and the complexity of the V-C dimension , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[142]  Noam Nisan,et al.  Hardness vs Randomness , 1994, J. Comput. Syst. Sci..

[143]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[144]  Yaoyun Shi.  Quantum and classical tradeoffs , 2005, Theor. Comput. Sci..

[145]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[146]  Jacobo Torán,et al.  Complexity classes defined by counting quantifiers , 1991, JACM.

[147]  Eric Allender,et al.  Counting Hierarchies: Polynomial Time and Constant Depth Circuits , 1993, Current Trends in Theoretical Computer Science.

[148]  Russell Impagliazzo,et al.  Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.

[149]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[150]  Neil Immerman,et al.  Complete problems for dynamic complexity classes , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[151]  Avi Wigderson,et al.  An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs , 2000, JACM.

[152]  Oded Goldreich,et al.  Quantifying knowledge complexity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[153]  Luca Trevisan,et al.  On Approximation Scheme Preserving Reducibility and Its Applications , 2000, Theory Comput. Syst..

[154]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[155]  Stephen A. Fenner.  Quantum NP is Hard for PH , 1998 .

[156]  Ran Canetti.  More on BPP and the Polynomial-Time Hierarchy , 1996, Inf. Process. Lett..

[157]  L. Hemachandra.  The strong exponential hierarchy collapses , 1987, STOC 1987.

[158]  David A. Mix Barrington,et al.  Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ , 1989, J. Comput. Syst. Sci..

[159]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[160]  Mitsunori Ogihara.  On Serializable Languages , 1994, Int. J. Found. Comput. Sci..

[161]  M. Rabin.  Degree of difficulty of computing a function and a partial ordering of recursive sets , 1960 .

[162]  Moni Naor,et al.  Efficient cryptographic schemes provably as secure as subset sum , 1989, 30th Annual Symposium on Foundations of Computer Science.

[163]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[164]  Eric Allender,et al.  Making Nondeterminism Unambiguous , 2000, SIAM J. Comput..

[165]  Lance Fortnow,et al.  One-sided Versus Two-sided Randomness , 1998 .

[166]  Scott Aaronson,et al.  Quantum lower bound for the collision problem , 2001, STOC '02.

[167]  Jin-Yi Cai,et al.  PSPACE Survives Constant-Width Bottlenecks , 1991, Int. J. Found. Comput. Sci..

[168]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[169]  Lane A. Hemaspaandra,et al.  Computing Solutions Uniquely Collapses the Polynomial Hierarchy , 1996, SIAM J. Comput..

[170]  Amnon Ta-Shma,et al.  Uniform hardness versus randomness tradeoffs for Arthur-Merlin games , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[171]  Johannes Köbler.  Strukturelle Komplexität von Anzahlproblemen , 1989 .

[172]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[173]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[174]  Johan Håstad,et al.  Statistical Zero-Knowledge Languages can be Recognized in Two Rounds , 1991, J. Comput. Syst. Sci..

[175]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[176]  Vikraman Arvind,et al.  Graph Isomorphism is in SPP , 2006, Inf. Comput..

[177]  Martin Nilsson,et al.  Parallel Quantum Computation and Quantum Codes , 2001, SIAM J. Comput..

[178]  Carme Àlvarez,et al.  A compendium of problems complete for symmetric logarithmic space , 2000, computational complexity.

[179]  Roy Steven Rubinstein.  Structural complexity classes of sparse sets: intractability, data compression and printability , 1988 .

[180]  Amit Sahai,et al.  Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK , 1998, CRYPTO.

[181]  Leonard M. Adleman,et al.  Recognizing primes in random polynomial time , 1987, STOC.

[182]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[183]  M. Jerrum.  Counting, Sampling and Integrating: Algorithms and Complexity , 2003 .

[184]  Stephen R. Mahaney.  Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..

[185]  N. V. Vinodchandran.  A note on the circuit complexity of PP , 2005, Theor. Comput. Sci..

[186]  Leslie G. Valiant,et al.  Completeness classes in algebra , 1979, STOC.

[187]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[188]  S.-Y. Kuroda,et al.  Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[189]  Hermann Jung.  On Probabilistic Time and Space , 1985, ICALP.

[190]  Michael Alekhnovich,et al.  Resolution Is Not Automatizable Unless W[P] Is Tractable , 2008, SIAM J. Comput..

[191]  Liming Cai,et al.  On fixed-parameter tractability and approximability of NP-hard optimization problems , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[192]  José L. Balcázar,et al.  Sparse Sets, Lowness and Highness , 1986, SIAM J. Comput..

[193]  Philippe Schnoebelen,et al.  Oracle Circuits for Branching-Time Model Checking , 2003, ICALP.

[194]  Jehoshua Bruck,et al.  Polynomial threshold functions, AC functions and spectrum norms , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[195]  John Watrous,et al.  PSPACE has constant-round quantum interactive proof systems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[196]  Jack H. Lutz,et al.  An Upward Measure Separation Theorem , 1991, Theor. Comput. Sci..

[197]  Albert R. Meyer,et al.  Cosmological lower bound on the circuit complexity of a small problem in logic , 2002, JACM.

[198]  Phokion G. Kolaitis,et al.  Logical Definability of NP Optimization Problems , 1994, Inf. Comput..

[199]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .

[200]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[201]  J. Hopcroft,et al.  Independence results in computer science , 1976, SIGA.

[202]  Keiji Matsumoto,et al.  Quantum multi-prover interactive proof systems with limited prior entanglement , 2003, J. Comput. Syst. Sci..

[203]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[204]  Cristopher Moore,et al.  Quantum and Stochastic Branching Programs of Bounded Width , 2002, ICALP.

[205]  Janos Simon,et al.  BPP and the polynomial time hierarchy in communication complexity , 1986 .

[206]  Christopher B. Wilson.  Relativized circuit complexity , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[207]  Christoph Meinel,et al.  Structure and Importance of Logspace-MOD-Classes , 1991, STACS.

[208]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

[209]  J. Köbler,et al.  The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[210]  Rafail Ostrovsky,et al.  One-way functions are essential for non-trivial zero-knowledge , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[211]  Troy Lee,et al.  Arithmetical definability over finite structures , 2003, Math. Log. Q..

[212]  Silvio Micali,et al.  Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[213]  Seymour Ginsburg,et al.  Deterministic Context Free Languages , 1966, Inf. Control..

[214]  Andrew Chi-Chih Yao.  Circuits and local computation , 1989, STOC '89.

[215]  Pierre McKenzie,et al.  Reversible space equals deterministic space , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[216]  José L. Balcázar,et al.  Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract) , 1990, MFCS.

[217]  Charles Rackoff,et al.  Relativized questions involving probabilistic algorithms , 1978, STOC 1978.

[218]  Nikolai K. Vereshchagin.  On The Power of PP , 1992, Computational Complexity Conference.

[219]  Eric Allender,et al.  Measure on small complexity classes, with applications for BPP , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[220]  Rocco A. Servedio,et al.  Learnability beyond AC0 , 2002, STOC '02.

[221]  Avi Wigderson,et al.  Boolean complexity classes vs. their arithmetic analogs , 1996, Random Struct. Algorithms.

[222]  Richard Cleve,et al.  Fast parallel circuits for the quantum Fourier transform , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[223]  Alexei Y. Kitaev,et al.  Parallelization, amplification, and exponential time simulation of quantum interactive proof systems , 2000, STOC '00.

[224]  Lance Fortnow,et al.  Hierarchy theorems for probabilistic polynomial time , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[225]  Peter Bro Miltersen,et al.  Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy , 1999 .

[226]  Seinosuke Toda,et al.  On the power of generalized Mod-classes , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[227]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[228]  Stuart A. Kurtz,et al.  Gap-definable counting classes , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[229]  Jacobo Torán,et al.  Turing Machines with Few Accepting Computations and Low Sets for PP , 1992, J. Comput. Syst. Sci..

[230]  Ravi Kannan,et al.  Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets , 1982, Inf. Control..

[231]  John Watrous,et al.  Limits on the power of quantum statistical zero-knowledge , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[232]  Noam Nisan,et al.  Symmetric logspace is closed under complement , 1995, STOC '95.

[233]  Keiji Matsumoto,et al.  Quantum Certificate Verification: Single versus Multiple Quantum Certificates , 2001, ArXiv.

[234]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[235]  Ian Parberry,et al.  On the Construction of Parallel Computers from Various Bases of Boolean Functions , 1986, Theor. Comput. Sci..

[236]  Desh Ranjan,et al.  Relativization: a revisionistic retrospective , 1992, Bull. EATCS.

[237]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[238]  Stephen A. Cook,et al.  Efficiently Approximable Real-Valued Functions , 2000, Electron. Colloquium Comput. Complex..

[239]  Julia Kempe,et al.  3-local Hamiltonian is QMA-complete , 2003, Quantum Inf. Comput..

[240]  Harumichi Nishimura,et al.  An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation , 2003, ArXiv.

[241]  Manfred K. Warmuth,et al.  Membership for Growing Context-Sensitive Grammars is Polynomial , 1986, J. Comput. Syst. Sci..

[242]  Ronald V. Book,et al.  Comparing Complexity Classes , 1974, J. Comput. Syst. Sci..

[243]  SystemsCarsten Lund,et al.  Algebraic Methods for Interactive Proof , 2010 .

[244]  H. Siegelmann,et al.  Analog computation with dynamical systems , 1998 .

[245]  Steven Rudich,et al.  Super-bits, Demi-bits, and NP/qpoly-natural Proofs , 1997, RANDOM.

[246]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[247]  Christian Glaßer,et al.  Disjoint NP-pairs , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[248]  Richard Beigel,et al.  Downward separation fails catastrophically for limited nondeterminism classes , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[249]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[250]  N. Vereshchagin,et al.  Oracle separation of complexity classes and lower bounds for perceptrons solving separation problems , 1995 .

[251]  Emil L. Post.  Recursively enumerable sets of positive integers and their decision problems , 1944 .

[252]  Silvio Micali,et al.  Everything Provable is Provable in Zero-Knowledge , 1990, CRYPTO.

[253]  Leslie G. Valiant,et al.  On Time Versus Space , 1977, JACM.

[254]  Elvira Mayordomo.  Contributions to the study of resource-bounded measure , 1994 .

[255]  Eric Allender,et al.  Power from random strings , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[256]  Rafail Ostrovsky,et al.  One-way functions, hard on average problems, and statistical zero-knowledge proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[257]  Elvira Mayordomo.  Almost Every Set in Exponential Time is P-bi-Immune , 1994, Theor. Comput. Sci..

[258]  Peter Bro Miltersen.  Circuit Depth Relative to a Random Oracle , 1992, Inf. Process. Lett..

[259]  Dieter van Melkebeek,et al.  Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses , 1999, STOC '99.

[260]  Rolf Niedermeier,et al.  Unambiguous Computations and Locally Definable Acceptance Types , 1998, Theor. Comput. Sci..

[261]  Russell Impagliazzo,et al.  Hardness as randomness: a survey of universal derandomization , 2003, ArXiv.

[262]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

[263]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.

[264]  Marek Karpinski,et al.  Randomness, Provability, and the Seperation of Monte Carlo Time and Space , 1987, Computation Theory and Logic.

[265]  PROBLEMCHRISTER BERG,et al.  ON THE BPP HIERARCHY , 1997 .

[266]  Harry Buhrman,et al.  Separating complexity classes using structural properties , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[267]  Alan Cobham,et al.  The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.

[268]  Michael R. Fellows,et al.  The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1] , 1996, DMTCS.

[269]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[270]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[271]  John C. Shepherdson,et al.  The Reduction of Two-Way Automata to One-Way Automata , 1959, IBM J. Res. Dev..

[272]  Pascal Koiran.  Hilbert's Nullstellensatz Is in the Polynomial Hierarchy , 1996, J. Complex..

[273]  Jim Kadin.  The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses , 1988, SIAM J. Comput..

[274]  Peter Bro Miltersen,et al.  On monotone planar circuits , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[275]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[276]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[277]  Mihir Bellare,et al.  The Complexity of Decision Versus Search , 1991, SIAM J. Comput..

[278]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.

[279]  Eric Allender,et al.  The Permanent Requires Large Uniform Threshold Circuits , 1999, Chic. J. Theor. Comput. Sci..

[280]  Alexander Russell,et al.  Symmetric alternation captures BPP , 1998, computational complexity.

[281]  James P. Crutchfield,et al.  Quantum automata and quantum grammars , 2000, Theor. Comput. Sci..

[282]  Luca Trevisan,et al.  On the Efficiency of Polynomial Time Approximation Schemes , 1997, Inf. Process. Lett..

[283]  Larry J. Stockmeyer,et al.  On Approximation Algorithms for #P , 1985, SIAM J. Comput..

[284]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[285]  Klaus W. Wagner,et al.  On Boolean Lowness and Boolean Highness , 1998, COCOON.

[286]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[287]  Scott Aaronson.  Quantum Computing and Dynamical Quantum Models , 2002 .

[288]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[289]  Robert Spalek,et al.  Quantum Circuits with Unbounded Fan-out , 2002, STACS.

[290]  Mark W. Krentel.  The Complexity of Optimization Problems , 1986, Computational Complexity Conference.

[291]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[292]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1984, SIAM J. Comput..

[293]  M. Fischer,et al.  SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC , 1974 .

[294]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[295]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[296]  N. V. Vinodchandran.  Counting Complexity of Solvable Black-Box Group Problems , 2004, SIAM J. Comput..

[297]  Tsuyoshi Morioka.  Classification of Search Problems and Their Definability in Bounded Arithmetic , 2001, Electron. Colloquium Comput. Complex..

[298]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[299]  Timothy J. Long,et al.  Quantitative Relativizations of Complexity Classes , 1984, SIAM J. Comput..

[300]  Lance Fortnow,et al.  Nonrelativizing separations , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

[301]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[302]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..

[303]  E. Szemerédi,et al.  Undirected connectivity in O(log/sup 1.5/n) space , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[304]  Andrew Chi-Chih Yao,et al.  Coherent Functions and Program ( extended abstract ) Checkers , .

[305]  Alexander A. Razborov,et al.  On provably disjoint NP-pairs , 1994, Electron. Colloquium Comput. Complex..

[306]  Nancy A. Lynch,et al.  Relativization of questions about log space computability , 1976, Mathematical systems theory.

[307]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

[308]  Ronald V. Book,et al.  On Languages Accepted in Polynomial Time , 1972, SIAM J. Comput..

[309]  Russell Impagliazzo,et al.  The Relative Complexity of NP Search Problems , 1998, J. Comput. Syst. Sci..

[310]  Andris Ambainis,et al.  Computing with highly mixed states (extended abstract) , 2000, STOC '00.

[311]  Amit Sahai,et al.  A complete promise problem for statistical zero-knowledge , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[312]  Peter Bro Miltersen,et al.  Searching constant width mazes captures the AC 0 hierarchy , 1997 .

[313]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..

[314]  Juris Hartmanis,et al.  Sparse Complete Sets for NP and the Optimal Collapse of the Polynomial Hierarchy , 1993, Current Trends in Theoretical Computer Science.

[315]  Scott Aaronson,et al.  Lower bounds for local search by quantum arguments , 2003, STOC '04.

[316]  Oded Goldreich,et al.  The Random Oracle Hypothesis Is False , 1994, J. Comput. Syst. Sci..

[317]  John Watrous,et al.  Succinct quantum proofs for properties of finite groups , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[318]  S. Aaronson.  Limitations of quantum advice and one-way communication , 2004 .

[319]  Michael Kharitonov,et al.  Cryptographic hardness of distribution-specific learning , 1993, STOC.

[320]  Eric Allender,et al.  Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds , 1999, J. Comput. Syst. Sci..

[321]  Stephen A. Cook,et al.  Complexity Theory of Parallel Time and Hardware , 1989, Inf. Comput..

[322]  Luca Trevisan,et al.  Structure in Approximation Classes , 1999, Electron. Colloquium Comput. Complex..

[323]  Luca Trevisan,et al.  Pseudorandomness and average-case complexity via uniform reductions , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[324]  Richard Beigel,et al.  On the relativized power of additional accepting paths , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[325]  Chris Pollett,et al.  On the complexity of quantum ACC , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[326]  S. Aaronson.  Is Quantum Mechanics An Island in Theoryspace , 2004, quant-ph/0401062.

[327]  Klaus W. Wagner,et al.  The complexity of combinatorial problems with succinct input representation , 1986, Acta Informatica.

[328]  Gábor Tardos,et al.  Query complexity, or why is it difficult to separateNPA∩coNPA fromPA by random oraclesA? , 1989, Comb..

[329]  Avi Wigderson,et al.  In search of an easy witness: exponential time vs. probabilistic polynomial time , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[330]  Oscar H. Ibarra.  A Note Concerning Nondeterministic Tape Complexities , 1972, JACM.

[331]  Ker-I Ko,et al.  Some Observations on the Probabilistic Algorithms and NP-hard Problems , 1982, Inf. Process. Lett..

[332]  Jacobo Torán,et al.  Graph isomorphism is low for PP , 1992, computational complexity.

[333]  L. Fortnow,et al.  On the power of multi-power interactive protocols , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[334]  Mikhail N. Vyalyi,et al.  QMA=PP implies that PP contains PH , 2003, Electron. Colloquium Comput. Complex..

[335]  Juris Hartmanis,et al.  Complexity Classes without Machines: On Complete Languages for UP , 1986, Theor. Comput. Sci..

[336]  Eric Allender,et al.  Circuit Complexity before the Dawn of the New Millennium , 1996, FSTTCS.

[337]  R. Friedberg,et al.  TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944). , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[338]  Scott Aaronson,et al.  Multilinear formulas and skepticism of quantum computing , 2003, STOC '04.

[339]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[340]  Giovanni Di Crescenzo,et al.  Image Density is Complete for Non-Interactive-SZK (Extended Abstract) , 1998, ICALP.

[341]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[342]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[343]  Christopher Umans.  The Minimum Equivalent DNF Problem and Shortest Implicants , 2001, J. Comput. Syst. Sci..

[344]  Tatsuaki Okamoto.  On Relationships between Statistical Zero-Knowledge Proofs , 2000, J. Comput. Syst. Sci..

[345]  Moni Naor,et al.  Pseudo-random functions and factoring (extended abstract) , 2000, STOC '00.

[346]  Richard Beigel,et al.  Perceptrons, PP, and the polynomial hierarchy , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[347]  Allan Borodin,et al.  Two Applications of Inductive Counting for Complementation Problems , 1989, SIAM J. Comput..

[348]  Lance Fortnow,et al.  The Role of Relativization in Complexity Theory , 1994, Bull. EATCS.

[349]  Uwe Schöning,et al.  A Low and a High Hierarchy within NP , 1983, J. Comput. Syst. Sci..

[350]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[351]  Avi Wigderson,et al.  On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[352]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[353]  Peter Bro Miltersen,et al.  On Pseudorandom Generators in NC , 2001, MFCS.

[354]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[355]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1993, JACM.

[356]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).