Skip to main content
SpringerLink
Log in

An Explicit Lower Bound of 5n − o(n) for Boolean Circuits

  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 2002 (MFCS 2002)

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

Abstract

The current best lower bound of 4.5n − o(n) for an explicit family of Boolean circuits [3] is improved to 5n − o(n) using the same family of Boolean function.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Blum. A 2.75n-lower bound on the network complexity of boolean functions. Tech. Rept. A 81/05, Universität des Saarlandes, 1981.

    Google Scholar 

  2. N. Blum. A Boolean function requiring 3n network size. Theoret. Comput. Sci., 28, pp. 337–345, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  3. O. Lachish and R. Raz. Explicit lower bound of 4.5n − o(n) for Boolean circuits. Proc. STOC’01, pp. 399–408, 2001.

    Google Scholar 

  4. W. Paul. A 2.5n-lower bound on the combinational complexity of boolean functions. SIAM J. Comput. 6, pp. 427–443, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  5. C. Schnorr. Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen. Computing 13, pp. 155–171, 1974.

    Article  MATH  MathSciNet  Google Scholar 

  6. L. Stockmeyer. On the combinational complexity of certain symmetric Boolean functions. Math. System Theory 10, pp. 323–336, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  7. I. Wegener. Branching programs and binary decision diagrams. SIAM Monographs on Discrete Mathematics and Applications, 1999.

    Google Scholar 

  8. U. Zwick. A 4n lower bound on the combinatorial complexity of certain symmetric Boolean functions over the basis of unate dyadic Boolean functions. SIAM J. Comput. 20, pp. 499–505, 1991.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Informatics, Kyoto University, Kyoto, 606-8501, Japan

    Kazuo Iwama & Hiroki Morizumi

Authors
  1. Kazuo Iwama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroki Morizumi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warszawa, Poland

    Krzysztof Diks  & Wojciech Rytter  & 

  2. Department of Computer Science, Liverpool University, Peach Street, Liverpool, L69 7ZF, UK

    Wojciech Rytter

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iwama, K., Morizumi, H. (2002). An Explicit Lower Bound of 5n − o(n) for Boolean Circuits. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-45687-2_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44040-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation