Skip to main content
SpringerLink
Log in

Lower bounds for boolean formulae of depth 3 and the topology of the n-Cube (Preliminary version)

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 199))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajtai, "∑ 11 -Formulae on Finite Structures", Ann. Pure and Appl. Logic, 24 (1983).

    Google Scholar 

  2. L. Budach, "Lower Bound for the Number of Nodes in a Decision Tree", EIK, submitted to publication.

    Google Scholar 

  3. A. Borodin, D. Dolev, F. Fich, W. Paul, "Bounds for width two branching programs", 15th STOC 1983.

    Google Scholar 

  4. M. Furst, J.B. Saxe, M. Sipser, "Parity, Circuits and the Polynomial Time Hierarchy", 22nd FOCS, 1981.

    Google Scholar 

  5. M. Klawe, W.J. Paul, N. Pippinger, M. Yannakakis, "On Monotone Formulae with Restricted Depth", 16th STOC, 1984.

    Google Scholar 

  6. C. Mead, C. Conway, "Introduction to VLSI-Systems", Addison-Wesley, Reading, Mass., 1980.

    Google Scholar 

  7. M. Metropolis, G.-C. Rota, "Combinatorial Structure of Faces of the n-Cube", SIAM J. Appl. Math. Vol. 35 No.4, 1978.

    Google Scholar 

  8. B.R. Plumstead, J.E. Plumstead, "Bounds for Cube Coloring", SIAM J. Alg. Disc. Meth., Vol 6, No 1, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Akademie der Wissenschaften der DDR, Institut für Mathematik, Mohrenstr. 39, Postfach 1304, DDR 1086, Berlin

    K. Kriegel & S. Waack

Authors
  1. K. Kriegel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Waack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation