Skip to main content
SpringerLink
Log in

Bounds for Hodes - Specker theorem

  • Section VI: Complexity Of Boolean Functions
  • Conference paper
  • First Online:
Logic and Machines: Decision Problems and Complexity (LaM 1983)

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

Included in the following conference series:

Abstract

In [2] Hodes and Specker proved a theorem which implies that certain Boolean functions have nonlinear formula size complexity. I shall prove that the asymptotic bound for the theorem is n.log log n.

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.J. Fischer, A.R. Meyer, M.S. Paterson: Ω (n log n) lower bounds on length of Boolean formulas, SIAM J. Comput. Vol. 11, No.3, 1982, 416–427.

    Google Scholar 

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

    Google Scholar 

  3. V.M. Khrapčenko: On the complexity of the realization of the linear function in class of π-cirquits, Mat. Zametki 9, 1 (1971), 35–40, (Russian).

    Google Scholar 

  4. V.M. Khrapčenko: The complexity of realization of symmetrical functions by formulae, Mat. Zametki 11, 1 (1972), 109–120, (Russian), English translation in Math. Notes of the Academy of Sciences of the USSR 11, (1972), 70–76.

    Google Scholar 

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

    Google Scholar 

  6. R.E. Kričevskij: A bound for the formula size complexity of a Boolean function, Diskretny j Analiz I, (1963), 13–23, also in Dokl. Akad. Nauk SSSR, Vol. 151, No. 4, 803–806, (Russian), English translation in Sov. Phys.-Dokl., Vol. 8, No. 8, (1964), 770–772.

    Google Scholar 

  7. L. Lovász: Combinatorial Problems and Exercises, Akadémiai Kiadó and North-Holland, 1979.

    Google Scholar 

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

    Google Scholar 

  9. P. Pudlák: Boolean complexity and Ramsey theorems, manuscript.

    Google Scholar 

  10. J.E. Savage: The Complexity of Computing, John Wiley and Sons, (1976).

    Google Scholar 

  11. B. Vilfan: Lower bounds for the size of expressions for certain functions in d-ary logic, Theoretical Comp. Sci. 2, (1976), 249–269.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute ČSAV, 115 67, Praha, Czechoslovakia

    Pavel Pudlák

Authors
  1. Pavel Pudlák
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Hasenjaeger D. Rödding

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pudlák, P. (1984). Bounds for Hodes - Specker theorem. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-13331-3_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13331-5

  • Online ISBN: 978-3-540-38856-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation