A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In

[1]  Andrew Chi-Chih Yao,et al.  Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.

[2]  Ronald Fagin,et al.  Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions , 1985, Theoretical Computer Science.

[3]  Richard J. Lipton,et al.  Unbounded fan-in circuits and associative functions , 1983, J. Comput. Syst. Sci..

[4]  Michael Sipser,et al.  A Topological View of Some Problems in Complexity Theory , 1984, MFCS.

[5]  Etienne Grandjean.  The Spectra of First-Order Sentences and Computational Complexity , 1984, SIAM J. Comput..

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

[7]  Wolfgang J. Paul,et al.  Two nonlinear lower bounds , 1983, STOC '83.

[8]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[9]  A. K. Chandra,et al.  A complexity theory for unbounded fan-in parallelism , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

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

[11]  Neil Immerman,et al.  Number of Quantifiers is Better Than Number of Tape Cells , 1981, J. Comput. Syst. Sci..

[12]  Neil Immerman,et al.  Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

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

[14]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[15]  Neil D. Jones,et al.  Turing machines and the spectra of first-order formulas with equality , 1972, STOC.

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

[17]  F. C. Hennie,et al.  One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..

[18]  Steven Orey,et al.  On ω-consistency and related properties , 1956, Journal of Symbolic Logic.

[19]  Leon Henkin,et al.  A generalization of the concept of ω-consistency , 1954, Journal of Symbolic Logic.

[20]  W. Feller.  An Introduction to Probability Theory and Its Applications , 1959 .