On the power of uniform families of constant depth threshold circuits

  • Eric Allender
  • Ulrich Hertrampf
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)


We prove that every set in uniform-AC0 can be recognized by a uniform family of depth-three threshold circuits of size \(n^{log^{O(1)} n}\).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ad-78]
    L. Adleman, Two theorems on random polynomial time, Proc. 19th IEEE Symposium on Foundations of Computer Science, pp. 75–83.Google Scholar
  2. [Al-89]
    E. Allender, A note on the power of threshold circuits, Proc. 30th IEEE Symposium on Foundations of Computer Science, pp. 580–584.Google Scholar
  3. [Al-89a]
    E. Allender, P-uniform circuit complexity, J. ACM 36, 912–928.Google Scholar
  4. [BIS-88]
    D. A. Mix Barrington, N. Immerman, and H. Straubing, On uniformity within NC 1, Proc. 3rd IEEE Structure in Complexity Theory Conference, pp. 47–59.Google Scholar
  5. [BS-89]
    J. Bruck and C. Smolensky, Polynomial threshold functions, AC 0 functions, and spectral norms, Tech. Report RJ 7140 (67387) IBM, Yorktown Heights.Google Scholar
  6. [HM-87]
    A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, G. Turán, Threshold circuits of bounded depth, Proc. 28th IEEE Symposium on Foundations of Computer Science, pp. 99–110.Google Scholar
  7. [Hå-87]
    J. Håstad, Computational limitations for small-depth circuits, Doctoral Dissertation, MIT.Google Scholar
  8. [La-83]
    C. Lautemann, BPP and the polynomial hierarchy, Information Processing Letters 17, 215–217.Google Scholar
  9. [NW-88]
    N. Nisan and A. Wigderson, Hardness vs. randomness, Proc. 29th IEEE Symposium on Foundations of Computer Science, pp. 2–11.Google Scholar
  10. [PS-88]
    I. Parberry and G. Schnitger, Parallel computation with threshold functions, J. Computer and System Science 36, 278–302.Google Scholar
  11. [Ra-87]
    A. A. Razborov, Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Mathematicheskie Zametki 41(4), 598–607. English translation in Mathematical Notes of the Academy of Sciences of the USSR 41:4, 333–338.Google Scholar
  12. [Ru-81]
    W. Ruzzo, On Uniform Circuit Complexity, J. Comput. and System Sci. 21, 365–383.Google Scholar
  13. [Si-83]
    M. Sipser, A complexity theoretic approach to randomness, Proc. 15th Annual ACM Symposium on Theory of Computing, pp. 330–335.Google Scholar
  14. [Sm-87]
    R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proc. 19th ACM Symposium on Theory of Computing, pp. 77–82.Google Scholar
  15. [VV-86]
    L. Valiant and V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science 47, 85–93.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Eric Allender
    • 1
  • Ulrich Hertrampf
    • 2
  1. 1.Department of Computer ScienceRutgers UniversityNew BrunswickUSA
  2. 2.Institut für InformatikUniversität WürzburgWürzburgFederal Republic of Germany

Personalised recommendations