Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1998)

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

Included in the following conference series:

Abstract

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.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. A. Bernasconi. On the Complexity of balanced Boolean Functions. CIAC’97, Lecture Notes in Computer Science 1203 (1997) pp. 253–263.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  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.

    Article  Google Scholar 

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

    Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  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. I. Wegener. The complexity of Boolean functions. Wiley-Teubner Series in Comp. Sci., New York — Stuttgart (1987).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Germany

    Anna Bernasconi

Authors
  1. Anna Bernasconi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Science, Academia Sinica, 11529, Nankang, Taipei, Taiwan

    Wen-Lian Hsu

  2. Department of Computer Science, Yale University, 51 Prospect Street, New Haven, CT, 06520, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernasconi, A. (1998). Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth. In: Hsu, WL., Kao, MY. (eds) Computing and Combinatorics. COCOON 1998. Lecture Notes in Computer Science, vol 1449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68535-9_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-68535-9_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68535-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation