The complexity theory companion

[1]  Richard E. Overill,et al.  Foundations of Cryptography: Basic Tools , 2002, J. Log. Comput..

[2]  Vikraman Arvind,et al.  On pseudorandomness and resource-bounded measure , 2001, Theor. Comput. Sci..

[3]  Christopher Homan.  Low Ambiguity in Strong, Total, Associative, One-Way Functions , 2000, ArXiv.

[4]  Lane A. Hemaspaandra,et al.  Reducing the Number of Solutions of NP Functions , 2002, J. Comput. Syst. Sci..

[5]  Thomas Thierauf,et al.  The complexity of verifying the characteristic polynomial and testing similarity , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[6]  Eric Allender,et al.  Complexity of finite-horizon Markov decision process problems , 2000, JACM.

[7]  Jörg Rothe,et al.  A second step towards complexity-theoretic analogs of Rice's Theorem , 2000, Theor. Comput. Sci..

[8]  Christian Glasser,et al.  Consequences of the Existence of Sparse Sets Hard for NP under a Subclass of Truth-Table Reductions , 2000 .

[9]  Joe Kilian,et al.  Primality testing using elliptic curves , 1999, JACM.

[10]  Jörg Rothe,et al.  Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory , 1999, J. Comput. Syst. Sci..

[11]  Richard Beigel,et al.  Circuit lower bounds collapse relativized complexity classes , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[12]  Lance Fortnow.  Relativized Worlds with an Infinite Hierarchy , 1999, Inf. Process. Lett..

[13]  Edith Hemaspaandra,et al.  Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries , 1999, STACS.

[14]  Edith Hemaspaandra,et al.  A Downward Collapse within the Polynomial Hierarchy , 1999, SIAM J. Comput..

[15]  Marius Zimand.  On the Size of Classes with Weak Membership Properties , 1998, Theor. Comput. Sci..

[16]  Edith Hemaspaandra,et al.  Downward Collapse from a Weaker Hypothesis , 1998, ArXiv.

[17]  Edith Hemaspaandra,et al.  Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP , 1998, Inf. Process. Lett..

[18]  Jörg Rothe,et al.  Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets , 1997, SIAM J. Comput..

[19]  Eric Allender,et al.  Making nondeterminism unambiguous , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[20]  Frank Stephan,et al.  Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory , 1997, Kurt Gödel Colloquium.

[21]  Edith Hemaspaandra,et al.  An Introduction to Query Order , 1997, Bull. EATCS.

[22]  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.

[23]  Bin Fu,et al.  Circuits over PP and PL , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[24]  Richard Beigel.  Closure properties of GapP and #P , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[25]  Nondeterministic NC¹ computation , 1997 .

[26]  Dieter van Melkebeek.  Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L , 1996, Computational Complexity Conference.

[27]  Vikraman Arvind,et al.  Quasi-Linear Truth-Table Reductions to p-Selective Sets , 1996, Theor. Comput. Sci..

[28]  Lane A. Hemaspaandra,et al.  Reducibility Classes of P-Selective Sets , 1996, Theor. Comput. Sci..

[29]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[30]  Jin-Yi Cai,et al.  On the Existence of Hard Sparse Sets under Weak Reductions , 1996, STACS.

[31]  Lane A. Hemaspaandra,et al.  Optimal Advice , 1996, Theor. Comput. Sci..

[32]  Judy Goldsmith,et al.  Scalability and the Isomorphism Problem , 1996, Inf. Process. Lett..

[33]  Phokion G. Kolaitis.  Hardness Of Approximations , 1996 .

[34]  M. Bellare.  Proof Checking and Approximation: Towards Tight Results , 1996 .

[35]  Lane A. Hemaspaandra,et al.  Worlds to die for , 1995, SIGA.

[36]  Sanjeev Arora.  Probabilistic checking of proofs and hardness of approximation problems , 1995 .

[37]  Jie Wang.  Some Results on Selectivity and Self-Reducibility , 1995, Inf. Process. Lett..

[38]  Lane A. Hemaspaandra,et al.  P-Selectivity: Intersections and Indices , 1995, Theor. Comput. Sci..

[39]  Johannes Köbler,et al.  On the Structure of Low Sets , 1995, SCT.

[40]  John D. Rogers.  The isomorphism conjecture holds and one-way functions exist relative to an oracle , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[41]  Howard Straubing,et al.  The power of local self-reductions , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

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

[43]  Aravind Srinivasan,et al.  Randomness-optimal unique element isolation, with applications to perfect matching and related problems , 1993, SIAM J. Comput..

[44]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

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

[46]  Lane A. Hemaspaandra,et al.  Semi-membership algorithms: some recent advances , 1994, SIGA.

[47]  Harry Buhrman,et al.  On the structure of complete sets , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[48]  Burchard von Braunmühl,et al.  The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite , 1994, STACS.

[49]  D. Sivakumar,et al.  Quasilinear Time Complexity Theory , 1994, STACS.

[50]  P. Beame.  A switching lemma primer , 1994 .

[51]  Bernd Borchert.  Predicate classes, promise classe, and the acceptance power of regular languages , 1994 .

[52]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

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

[54]  Peter van Emde Boas,et al.  Twenty Questions to a P-Selector , 1993, Inf. Process. Lett..

[55]  Andrew Chi-Chih Yao,et al.  A Circuit-Based Proof of Toda's Theorem , 1993, Inf. Comput..

[56]  Edith Hemaspaandra,et al.  A modal perspective on the computational complexity of attribute value grammar , 1993, J. Log. Lang. Inf..

[57]  Harry Buhrman,et al.  P-selective self-reducibles sets: a new characterization of P , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[58]  Mitsunori Ogihara,et al.  P-selective sets, and reducing search to decision vs. self-reducibility , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[59]  Lance Fortnow,et al.  Gap-Definability as a Closure Property , 1993, STACS.

[60]  Sanjay Gupta,et al.  On the Closure of Certain Function Classes Under Integer Division by Polynomially-Bounded Functions , 1992, Inf. Process. Lett..

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

[62]  Paul Young.  How reductions to sparse sets collapse the polynomial-time hierarchy: a primer: Part II restricted polynomial-time reductions , 1992, SIGA.

[63]  Danilo Bruschi.  Strong Separations of the Polynomial Hierarchy with Oracles: Constructive Separations by Immune and Simple Sets , 1992, Theor. Comput. Sci..

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

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

[66]  Osamu Watanabe,et al.  How hard are sparse sets? , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

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

[68]  Michael Ben-Or,et al.  Computing Algebraic Formulas Using a Constant Number of Registers , 1992, SIAM J. Comput..

[69]  Lane A. Hemaspaandra,et al.  Is #P Closed under Substraction? , 1992, Bull. EATCS.

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

[71]  Adi Shamir,et al.  Fully parallelized multi prover protocols for NEXP-time , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[72]  Jürgen Kämper,et al.  Nonuniform Proof Systems: A New Framework to Describe Nonuniform and Probabilistic Complexity Classes , 1991, Theor. Comput. Sci..

[73]  R. Beigel,et al.  Bounded Queries to SAT and the Boolean Hierarchy , 1991, Theor. Comput. Sci..

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

[75]  Daniel A. Spielman,et al.  The perceptron strikes back , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[76]  Lance Fortnow,et al.  PP is closed under truth-table reductions , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[77]  S. Homer,et al.  On reductions of NP sets to sparse sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[78]  Lane A. Hemaspaandra,et al.  On Sets Polynomially Enumerable by Iteration , 1991, Theor. Comput. Sci..

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

[80]  Edith Hemaspaandra,et al.  Bounded Reductions , 1991, Complexity Theory: Current Research.

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

[82]  Ronitt Rubinfeld,et al.  Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.

[83]  Richard Beigel,et al.  Relativized Counting Classes: Relations among Thresholds, Parity, and Mods , 1991, J. Comput. Syst. Sci..

[84]  Viktória Zankó,et al.  #P-Completeness via Many-One Reductions , 1990, Int. J. Found. Comput. Sci..

[85]  H. Venkateswaran,et al.  Properties that characterize LOGCFL , 1987, J. Comput. Syst. Sci..

[86]  Lane A. Hemaspaandra,et al.  On the Complexity of Ranking , 1990, J. Comput. Syst. Sci..

[87]  Juris Hartmanis,et al.  Robust Machines Accept Easy Sets , 1990, Theor. Comput. Sci..

[88]  Lane A. Hemaspaandra,et al.  On sets with efficient implicit membership tests , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[89]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[90]  Joan Feigenbaum,et al.  Hiding Instances in Multioracle Queries , 1990, STACS.

[91]  Denis Thérien,et al.  Non-Uniform Automata Over Groups , 1987, Inf. Comput..

[92]  Sanjay Jain,et al.  On the Limitations of Locally Robust Positive Reductions , 1989, FSTTCS.

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

[94]  Stuart A. Kurtz,et al.  The ismorphism conjecture fails relative to a random oracle , 1989, STOC '89.

[95]  Richard J. Lipton,et al.  New Directions In Testing , 1989, Distributed Computing And Cryptography.

[96]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[97]  Ker-I Ko.  Relativized polynomial time hierarchies having exactly K levels , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

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

[99]  Osamu Watanabe,et al.  On Hardness of One-Way Functions , 1988, Inf. Process. Lett..

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

[101]  Jim Kadin,et al.  P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP , 1989, J. Comput. Syst. Sci..

[102]  Stathis Zachos,et al.  Probabalistic Quantifiers vs. Distrustful Adversaries , 1987, FSTTCS.

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

[104]  Juris Hartmanis,et al.  On Sparse Oracles Separating Feasible Complexity Classes , 1986, STACS.

[105]  Ding-Zhu Du,et al.  On One-Way Functions and Polynomial-Time Isomorphisms , 1986, Theor. Comput. Sci..

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

[107]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[108]  Stathis Zachos,et al.  A Decisive Characterization of BPP , 1986, Inf. Control..

[109]  Allan Borodin,et al.  Bounds for width two branching programs , 1983, SIAM J. Comput..

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

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

[112]  Vijay V. Vazirani,et al.  Random polynomial time is equal to slightly-random polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[113]  Alan L. Selman,et al.  Qualitative Relativizations of Complexity Classes , 1985, J. Comput. Syst. Sci..

[114]  Ker-I Ko,et al.  On Circuit-Size Complexity and the Low Hierarchy in NP , 1985, SIAM J. Comput..

[115]  David A. Russo.  Structural properties of complexity classes , 1985, Research in computer science.

[116]  Paul Young,et al.  Reductions Among Polynomial Isomorphism Types , 1985, Theor. Comput. Sci..

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

[118]  Michael Ben-Or,et al.  A theorem on probabilistic constant depth Computations , 1984, STOC '84.

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

[120]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

[121]  Michael Sipser,et al.  Borel sets and circuit complexity , 1983, STOC.

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

[123]  Chee-Keng Yap,et al.  Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

[124]  Yaacov Yesha,et al.  On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets , 1983, SIAM J. Comput..

[125]  Ker-I Ko.  On Self-Reducibility and Weak P-Selectivity , 1983, J. Comput. Syst. Sci..

[126]  Christos H. Papadimitriou,et al.  Two remarks on the power of counting , 1983, Theoretical Computer Science.

[127]  Timothy J. Long.  Strong Nondeterministic Polynomial-Time Reducibilities , 1982, Theor. Comput. Sci..

[128]  Zoltán Füredi,et al.  Families of Finite Sets in Which No Set Is Covered by the Union of Two Others , 1982, J. Comb. Theory, Ser. A.

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

[130]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[131]  Joel I. Seiferas,et al.  Limitations on Separating Nondeterministic Complexity Classes , 1981, SIAM J. Comput..

[132]  Leslie G. Valiant,et al.  A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

[134]  John E. Hopcroft,et al.  Recent Directions in Algorithmic Research , 1981, Theoretical Computer Science.

[135]  John E. Hopcroft,et al.  Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[136]  Patrick C. Fischer,et al.  Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations , 1980, SIAM J. Comput..

[137]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[138]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[139]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[140]  Gilles Brassard,et al.  A note on the complexity of cryptography (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[141]  Steven Fortune,et al.  A Note on Sparse Complete Sets , 1978, SIAM J. Comput..

[142]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[143]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[144]  Piotr Berman.  Relationship Between Density and Deterministic Complexity of NP-Complete Languages , 1978, ICALP.

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

[146]  Richard J. Lipton,et al.  A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..

[147]  Gilles Brassard,et al.  A Note on Cryptography and NPnCoNP-P, , 1978 .

[148]  L. Berman.  Polynomial reducibilities and complete sets. , 1977 .

[149]  Istvan Simon.  On some subrecursive reducibilities , 1977 .

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

[151]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[152]  Alan J. Demers,et al.  Some Comments on Functional Self-Reducibility and the NP Hierarchy , 1976 .

[153]  Leslie G. Valiant,et al.  Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[154]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

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

[156]  Ronald V. Book,et al.  Tally Languages and Complexity Classes , 1974, Inf. Control..

[157]  Nancy A. Lynch,et al.  Comparison of polynomial-time reducibilities , 1974, STOC '74.

[158]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[159]  Stephen A. Cook,et al.  A hierarchy for nondeterministic time complexity , 1972, J. Comput. Syst. Sci..

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

[161]  Stephen A. Cook,et al.  Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of Functions , 1969 .

[162]  Richard Edwin Stearns,et al.  Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

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

[164]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

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

[166]  D. Bernstein.  DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS , 2022 .