Skip to main content
SpringerLink
Log in

A lower bound on complexity of branching programs

Extended abstract

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

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

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, Annals of Pure and Applied Logic 24 (1983), pp. 1–48.

    Google Scholar 

  2. A. Borodin, D. Dolev, F.E. Fich and W. Paul, Bounds for width two branching programs, 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 87–93.

    Google Scholar 

  3. A.K. Chandra, M.L. Furst and R.J. Lipton, Multiparty protocols, ibidem pp. 94–99.

    Google Scholar 

  4. M.J. Fischer, A.R. Meyer and M.S. Paterson, Ω (n log n) lower bounds on length of Boolean formulas, SIAM J. Comput. Vol. 11, No. 3, 1982, pp. 416–427.

    Google Scholar 

  5. M. Furst, J.B. Saxe, M. Sipser, Parity, cirquits and the polynomial-time hierarchy, 27nd Symposium on the Foundations of Computer Science, 1981, pp. 260–270.

    Google Scholar 

  6. L. Hodes and E. Specker, Lengths of formulas and elimination of quantifiers I, in Contributions to Mathematical Logic, H.A. Schmidt, K. Schütz, H.-J. Thiele, eds., North-Holland, 1968, pp. 175–188.

    Google Scholar 

  7. V.M. Khrapčenko, Complexity of realization of symmetric Boolean functions on finite basis, Problemy Kibernetiki 31, 1976, pp. 231–234, (Russian).

    Google Scholar 

  8. E.J. Nečiporuk, A Boolean function, Dokl. Acad. Nauk SSSR, Vol. 169, No. 4, 1966, pp. 765–766, (Russian), English translation in Sov. Math.-Dokl. Vol. 7, No. 4, pp. 999–1000.

    Google Scholar 

  9. P. Pudlák, Bounds for Hodes-Specker theorem, in Rekrusive Kombinatorik, Münster, 1983, Springer-Verlag, to appear.

    Google Scholar 

  10. P. Pudlák and S. Žák, Space complexity of computations, manuscript.

    Google Scholar 

  11. J.E. Savage, The Complexity of Computing, John Wiley and Sons, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, Cze choslovak Academy of Sciences, 115 67, Praha 1, Czechoslovakia

    P. Pudlák

Authors
  1. P. Pudlák
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pudlák, P. (1984). A lower bound on complexity of branching programs. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030331

Download citation

  • DOI: https://doi.org/10.1007/BFb0030331

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation