Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth

  • Anna Bernasconi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1449)


Any attempt to find connections between mathematical properties and complexity has a strong relevance to the field of Complexity Theory. This is due to the lack of mathematical techniques to prove lower bounds for general models of computation.

This work represents a step in this direction: we define a combinatorial property that makes Boolean functions “hard” to compute and show how the harmonic analysis on the hypercube can be applied to derive new lower bounds on the size complexity of previously unclassified Boolean functions.


Boolean Function Parity Function Combinatorial Property Constant Depth Spectral Characterization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Bernasconi. On the Complexity of balanced Boolean Functions. CIAC’97, Lecture Notes in Computer Science 1203 (1997) pp. 253–263.Google Scholar
  2. 2.
    M. Furst, J. Saxe, M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory, Vol. 17 (1984) pp. 13–27.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    J. Håstad. Computational limitations for small depth circuits. Ph.D. Dissertation, MIT Press, Cambridge, Mass. (1986).Google Scholar
  4. 4.
    S.L. Hurst, D.M. Miller, J.C. Muzio. Spectral Method of Boolean Function Complexity. Electronics Letters, Vol. 18(33) (1982) pp. 572–574.CrossRefMathSciNetGoogle Scholar
  5. 5.
    R. J. Lechner. Harmonic Analysis of Switching Functions. In Recent Development in Switching Theory, Academic Press (1971) pp. 122–229.Google Scholar
  6. 6.
    N. Linial, Y. Mansour, N. Nisan. Constant Depth Circuits, Fourier Transform, and Learnability. Journal of the ACM, Vol. 40(3) (1993) pp. 607–620.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    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
  8. 8.
    I. Wegener. The complexity of Boolean functions. Wiley-Teubner Series in Comp. Sci., New York — Stuttgart (1987).zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Anna Bernasconi
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenGermany

Personalised recommendations