PROBABILISTIC TECHNIQUES IN STRUCTURAL COMPLEXITY THEORY

viii

[1]  Juris Hartmanis,et al.  On Log-Tape Isomorphisms of Complete Sets , 1978, Theor. Comput. Sci..

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

[3]  Mitsunori Ogihara.  Sparse Hard Sets for P Yield Space-Efficient Algorithms , 1996, Chic. J. Theor. Comput. Sci..

[4]  M. Gromov,et al.  L'enseignement Mathématique on the Entropy of Holomorphic Maps , 2022 .

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

[6]  Alexander A. Razborov,et al.  Natural Proofs , 1997, J. Comput. Syst. Sci..

[7]  Johan Håstad,et al.  Pseudo-random generators under uniform assumptions , 1990, STOC '90.

[8]  Johan Hstad,et al.  Construction of a pseudo-random generator from any one-way function , 1989 .

[9]  D. Bailin.  Field theory , 1979, Nature.

[10]  J. H. Lutz.  One-Way Functions and Balanced NP , 1992 .

[11]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[12]  A. Razborov.  Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic , 1995 .

[13]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[14]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[15]  Meera Sitharam,et al.  Pseudorandom generators and learning algorithms for AC , 1994, STOC '94.

[16]  Noam Nisan,et al.  More deterministic simulation in logspace , 1993, STOC.

[17]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: Preface , 1994 .

[18]  Stephen R. Mahaney.  Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

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

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

[21]  Noam Nisan.  Using hard problems to create pseudorandom generators , 1992, ACM Distinguished Dissertations.

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

[23]  Jack H. Lutz,et al.  Almost everywhere high nonuniform complexity , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[24]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

[25]  Noam Nisan,et al.  Approximate Inclusion-Exclusion , 1990, Comb..

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

[27]  I. G. BONNER CLAPPISON.  Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[28]  Desh Ranjan,et al.  On randomized reductions to sparse sets , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

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

[30]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[31]  Jin-Yi Cai,et al.  Pseudorandom generators, measure theory, and natural proofs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[32]  Jack H. Lutz,et al.  Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small , 1996, Theor. Comput. Sci..

[33]  Kenneth W. Regan,et al.  Improved Resource-Bounded Borel-Cantelli and Stochasticity Theorems , 1995 .

[34]  Martin Strauss.  Measure on P: Strength of the Notion , 1997, Inf. Comput..

[35]  Noam Nisan,et al.  Pseudorandom bits for constant depth circuits , 1991, Comb..

[36]  Jack H. Lutz,et al.  The quantitative structure of exponential time , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[37]  Walter J. Savitch,et al.  Maze Recognizing Automata and Nondeterministic Tape Complexity , 1973, J. Comput. Syst. Sci..

[38]  Hans Heller,et al.  On Relativized Exponential and Probabilistic Complexity Classes , 1986, Inf. Control..

[39]  J. D. Knowles,et al.  MEASURE AND CATEGORY , 1974 .

[40]  K. Mulmuley.  A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , 1987, Comb..

[41]  Leonid A. Levin,et al.  Pseudo-random Generation from one-way functions (Extended Abstracts) , 1989, STOC 1989.

[42]  Róbert Szelepcsényi.  The moethod of focing for nondeterministic automata , 1987, Bull. EATCS.

[43]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

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

[45]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[46]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[47]  Adi Shamir,et al.  On the generation of cryptographically strong pseudorandom sequences , 1981, TOCS.

[48]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.