Skip to main content
SpringerLink
Log in

On the complexity of balanced Boolean functions

  • Regular Presentations
  • Conference paper
  • First Online:
Algorithms and Complexity (CIAC 1997)

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

Included in the following conference series:

Abstract

This paper introduces the notions of balanced and strongly balanced Boolean functions and examines the complexity of these functions using harmonic analysis on the hypercube. The results are applied to derive a lower bound related to AC 0 functions.

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. A. Bernasconi, B. Codenotti. Sensitivity of Boolean Functions, Abstract Harmonic Analysis and Circuit Complexity. ICSI Technical Report TR-93-030 (1993).

    Google Scholar 

  2. A. Bernasconi, B. Codenotti, J. Simon. On the Fourier Analysis of Boolean Functions. Submitted for publication (1996).

    Google Scholar 

  3. M. Furst, J. Saxe, M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory, Vol. 17 (1984), pp. 13–27.

    Google Scholar 

  4. J. Håstad. Computational limitations for small depth circuits. Ph.D. Dissertation, MIT Press, Cambridge, Mass. (1986).

    Google Scholar 

  5. S.L. Hurst, D.M. Miller, J.C. Muzio. Spectral Method of Boolean Function Complexity. Electronics Letters, Vol. 18 (33) (1982), pp. 572–574.

    Google Scholar 

  6. R. J. Lechner. Harmonic Analysis of Switching Functions. In Recent Development in Switching Theory, Academic Press (1971), pp. 122–229.

    Google Scholar 

  7. N. Linial, Y. Mansour, N. Nisan. Constant Depth Circuits, Fourier Transform, and Learnability. Journal of the ACM, Vol. 40 (3) (1993), pp. 607–620.

    Google Scholar 

  8. H. U. Simon. A tight Ω(log log n) bound on the time for parallel RAM's to compute nondegenerate Boolean functions. FCT'83, Lecture Notes in Computer Science 158 (1983).

    Google Scholar 

  9. I. Wegener. The complexity of Boolean functions. Wiley-Teubner Series in Comp. Sci., New York — Stuttgart (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Italy

    A. Bernasconi

  2. Istituto di Matematica Computazionale del C.N.R., Pisa

    A. Bernasconi

Authors
  1. A. Bernasconi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giancarlo Bongiovanni Daniel Pierre Bovet Giuseppe Di Battista

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernasconi, A. (1997). On the complexity of balanced Boolean functions. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds) Algorithms and Complexity. CIAC 1997. Lecture Notes in Computer Science, vol 1203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62592-5_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-62592-5_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68323-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation