Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai, "∑ 11 -Formulae on Finite Structures", Ann. Pure and Appl. Logic, 24 (1983).
L. Budach, "Lower Bound for the Number of Nodes in a Decision Tree", EIK, submitted to publication.
A. Borodin, D. Dolev, F. Fich, W. Paul, "Bounds for width two branching programs", 15th STOC 1983.
M. Furst, J.B. Saxe, M. Sipser, "Parity, Circuits and the Polynomial Time Hierarchy", 22nd FOCS, 1981.
M. Klawe, W.J. Paul, N. Pippinger, M. Yannakakis, "On Monotone Formulae with Restricted Depth", 16th STOC, 1984.
C. Mead, C. Conway, "Introduction to VLSI-Systems", Addison-Wesley, Reading, Mass., 1980.
M. Metropolis, G.-C. Rota, "Combinatorial Structure of Faces of the n-Cube", SIAM J. Appl. Math. Vol. 35 No.4, 1978.
B.R. Plumstead, J.E. Plumstead, "Bounds for Cube Coloring", SIAM J. Alg. Disc. Meth., Vol 6, No 1, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kriegel, K., Waack, S. (1985). Lower bounds for boolean formulae of depth 3 and the topology of the n-Cube (Preliminary version). In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028806
Download citation
DOI: https://doi.org/10.1007/BFb0028806
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15689-5
Online ISBN: 978-3-540-39636-9
eBook Packages: Springer Book Archive