Skip to main content
SpringerLink
Log in

AC0 circuit complexity

A survey of lower bounds

  • Invited Lectures
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1993)

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

Included in the following conference series:

  • 177 Accesses

Abstract

We shall survey several lower bound methods for AC0-circuits including some recent unpublished work. The main methods discussed here include random restrictions, approximations by low degree polynomials, a top-down method based on k-limits and the Fourier transform of boolean functions.

The paper has been written while visiting Fachbereich Informatik, Universität Dortmund as a Humboldt Fellow.

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. Ajtai,Σ 11 -formulae on finite structures, Annals of Pure and Applied Logic, 24/1 (1983), 1–48

    Article  Google Scholar 

  2. J. Aspnes, R. Beigel, M. Fürst, and S. Rudich, The expressive power of voting polynomials, In STOC 1991, 402–409

    Google Scholar 

  3. L. Babai, P. Frankl, J. Simon, Complexity classes in communication complexity theory, FOCS 1986, 337–347

    Google Scholar 

  4. R. Beigel, The polynomial method in circuit complexity, preprint

    Google Scholar 

  5. R.B. Boppana, Threshold functions and bounded depth monotone circuits, JCSS 32, 222–229

    Google Scholar 

  6. R.B. Boppana and M. Sipser, The complexity of finite functions, In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, MIT Press and Elsevier, The Netherlands, 1990, 757–804

    Google Scholar 

  7. P. Erdös, and R. Rado, Intersection theorems for systems of sets, J. London Math. Soc. 35, (1960), 85–90

    Google Scholar 

  8. M. Furst, J. B. Saxe, and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Mathematical Systems Theory, 17(1), (1984), 13–27

    Article  Google Scholar 

  9. J. Håstad, Almost optimal lower bounds for small depth circuits, in STOC 1986, 6–20, full version in Advances in Computing Research 5, 143–170

    Google Scholar 

  10. J. Håstad, The shrinkage constant is 2, preprint

    Google Scholar 

  11. J. Håstad, Lower bounds for Parity, a top down proof, Technical Report TRITANA-9304, (1993), Royal Institute of Technology, Stockholm, Sweden

    Google Scholar 

  12. J. Håstad, S. Jukna, P. Pudlák, Top-down lower bounds for depth 3 circuits, preprint

    Google Scholar 

  13. M. Karchmer and A. Wigderson, Monotone circuits for connectivity require superlogarithmic depth, SIAM J. on Disc. Math.3, (1990), 255–265

    Article  Google Scholar 

  14. M. Klawe, W.J. Paul, N. Pippenger, M. Yannakakis, On monotone formulae with restricted depth, in STOC 1984, 480–487

    Google Scholar 

  15. K. Kriegel, S. Waack, Lower bounds for boolean formulas of depth 3 and the topology of the n-cube, FCT 1985, 227–233

    Google Scholar 

  16. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform, and learnability, in FOCS 1989, 574–579

    Google Scholar 

  17. E.I. Nechiporuk, On a boolean function (in Russian), Doklady Akademii Nauk SSSR 169/4, (1966), 765–766

    Google Scholar 

  18. M. Sipser, A topological view of some problems in complexity theory, in Colloquia Mathematica Societatis János Bolyai 44, (1985), 387–391

    Google Scholar 

  19. R. Smolensky. Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in STOC 1987, 77–82

    Google Scholar 

  20. A.A. Razborov, Lower bounds for the size of circuits of bounded depth with basis {∧, ⊕}, Math. notes of the Academy of Science of the USSR, 41(4), (1987), 333–338

    Article  Google Scholar 

  21. G.A. Tkachov, On complexity of realization of a sequence of boolean functions by schemas of functional elements and II-schemas under additional restrictions on the structure of the schemas, (in Russian) In Kombinatorno-algebraicheskie metody v prikladnoj matematike, Gorkij, 1980, 161–207

    Google Scholar 

  22. L.G. Valiant, Graph-theoretic arguments in low level complexity, MFCS 1977, Springer-Verlag LNCS, 162–176

    Google Scholar 

  23. L.G. Valiant, V.V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science 47, (1986), 85–93

    Article  Google Scholar 

  24. A. Woods, a lecture given at the Workshop on Proof Theory, Arithmetic and Complexity, Prague, 1991

    Google Scholar 

  25. A. C.-C. Yao, Separating the polynomial-time hierarchy by oracles, in FOCS 1985, 1–10

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute AVČR, Žitná 25, 11567, Praha 1, Czech Republic

    P. Pudlák

Authors
  1. P. Pudlák
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pudlák, P. (1993). AC0 circuit complexity. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-57163-9_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47923-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation