This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai, ∑ 11 -formulae on finite structures, Ann. Applied and Pure Logic 24 (1983), 1–48.
T. Baker, J. Gill, and R. Solovay, Relativizations of the P-?NP Question, SIAM J. Comp. (1975), 431–442.
A. Chandra, S. Fortune, and R. Lipton, Unbounded fan-in circuits and associative functions, Proc. 15th ACM Symp. on Theory of Comp. (1983), 52–60.
A. Chandra, L. Stockmeyer, and U. Vishkin, A complexity theory for unbounded fan-in parallelism, Proc. 23rd IEEE Symp. on Found. Comp. Sci. (1982), 1–13.
S. Cook, The complexity of theorem-proving procedures, Proc. Third ACM Symp. on Theory of Comp. (1971), 151–158.
P. Duris, Z. Galil, W. Paul, and R. Reischuk, Two nonlinear lower bounds, Proc. 15th ACM Symp. on Theory of Comp. (1983), 127–132.
R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, Complexity of Computation, R.M. Karp, ed., AMS, Providence (1974), 43–73.
R. Fagin, M. Klawe, N. Pippenger, and L. Stockmeyer, Bounded-depth, polynomial-size circuits for symmetric functions, Theoretical Comp. Sci. 36 (1985), 239–250.
W. Feller, An Introduction to Probability Theory and its Applications, Vol. I, 3rd ed., Wiley, New York (1968).
M. Furst, J. Saxe, and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Math. Systems Theory 17 (1984), 13–27.
E. Grandjean, The spectra of first-order sentences and computational complexity, SIAM J. Computing 13 (1984), 356–373.
L. Henkin, A generalization of the concept of ω-consistency, J. Symbolic Logic 19 (1954), 183–196.
F. Hennie, One-tape off-line Turing machine computations, Information and Control 8 (1965), 553–578.
J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass. (1979).
N. Immerman, Number of quantifiers is better than number of tape cells, J. Comp. Sys. Sci. 22 (1981), 384–406.
—, Upper and lower bounds for first-order expressibility, J. Comp. Sys. Sci. 25 (1982), 76–98.
N. Jones and A. Selman, Turing machines and the spectra of first-order formulas with equality, J. Symbolic Logic 39 (1974), 139–150.
H. Keisler, Forcing and the Omitting Types Theorem, Stud. in Model Theory, MAA Studies in Math., Vol. 8, MAA, Buffalo (1973), 96–133.
K. Kuratowski, Topology, Academic Press (1966).
J. Lynch, Complexity classes and theories of finite models, Math. Systems Theory 15 (1982), 127–144.
S. Orey, On ω-consistency and related properties, J. Symbolic Logic 21 (1956), 246–252.
M. Sipser, Borel sets and circuit complexity, Proc. 15th ACM Symp. on Theory of Comp. (1983), 61–69.
—, A topological view of some problems in complexity theory, to appear.
A. Yao, Separating the polynomial-time hierarchy by cracles, Proc. 26th IEEE Symp. on Found. Comp. Sci. (1985), 1–10.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lynch, J.F. (1986). A depth-size tradeoff for boolean circuits with unbounded fan-in. In: Selman, A.L. (eds) Structure in Complexity Theory. Lecture Notes in Computer Science, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16486-3_102
Download citation
DOI: https://doi.org/10.1007/3-540-16486-3_102
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16486-9
Online ISBN: 978-3-540-39825-7
eBook Packages: Springer Book Archive