Advertisement

computational complexity

, Volume 2, Issue 4, pp 277–300 | Cite as

Majority gates vs. general weighted threshold gates

  • Mikael Goldmann
  • Johan Håstad
  • Alexander Razborov
Article

Abstract

In this paper we study small depth circuits that contain threshold gates (with or without weights) and parity gates. All circuits we consider are of polynomial size. We prove several results which complete the work on characterizing possible inclusions between many classes defined by small depth circuits. These results are the following:
  1. 1.

    A single threshold gate with weights cannot in general be replaced by a polynomial fan-in unweighted threshold gate of parity gates.

     
  2. 2.

    On the other hand it can be replaced by a depth 2 unweighted threshold circuit of polynomial size. An extension of this construction is used to prove that whatever can be computed by a depthd polynomial size threshold circuit with weights can be computed by a depthd+1 polynomial size unweighted threshold circuit, whered is an arbitrary fixed integer.

     
  3. 3.

    A polynomial fan-in threshold gate (with weights) of parity gates cannot in general be replaced by a depth 2 unweighted threshold circuit of polynomial size.

     

Key words

circuit complexity majority circuits threshold circuits lower bounds 

Subject classifications

68Q15 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. Allender, A note on the power of threshold circuts, inProceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, 580–584.Google Scholar
  2. [2]
    J. Bruck, Harmonic analysis of polynomial threshold functions,SIAM Journal on Discrete Mathematics 3(2) (1990), 168–177.Google Scholar
  3. [3]
    J. Bruck and R. Smolensky, Polynomial threshold functions,AC 0 functions and spectral norms, inProceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, 632–641.Google Scholar
  4. [4]
    Y. Freund, Boosting a weak learning algorithm by majority, inWorkshop on Computational Learning Theory, Morgan Kaufmann, 1990, 202–216.Google Scholar
  5. [5]
    M. Goldmann and M. Karpinski, Constructing depthd+1 majority circuits that simulate depthd threshold circuits, manuscript, 1992.Google Scholar
  6. [6]
    A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, and G. Turán, Threshold circuits of bounded depth, inProceedings of 28 IEEE Symposium on Foundations of Computer Science, 1987, 99–110.Google Scholar
  7. [7]
    J. Håstad and M. Goldmann, On the power of small-depth threshold circuits, inProceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, 610–618.Google Scholar
  8. [8]
    J. Hertz, R. Krogh, and A. Palmer,An Introduction to the Theory of Neural Computation, Addison-Wesley, 1991.Google Scholar
  9. [9]
    M. Hofri,Probabilistic Analysis of Algorithms, Springer-Verlag, 1987.Google Scholar
  10. [10]
    M. Krause, Geometric arguments yield better bounds for threshold circuits and distributed computing, inProceedings of the 6th Structure in Complexity Theory Conference, 1991, 314–322.Google Scholar
  11. [11]
    M. Krause and S. Waack, Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fanin, inProceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991, 777–782.Google Scholar
  12. [12]
    W. Maass, G. Schnitger, and E. Sontag, On the computational power of sigmoid versus boolean threshold circuits, inProceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991, 767–776.Google Scholar
  13. [13]
    S. Muroga,Threshold logic and its applications, Wiley-Interscience, 1971.Google Scholar
  14. [14]
    J. Myhill andW. H. Kautz, On the size of weights required for linear-input switching functions,IRE Trans. on Electronic Computers EC10(2) (1961), 288–290.Google Scholar
  15. [15]
    G. Owen,Game theory, Academic press, second edition, 1982.Google Scholar
  16. [16]
    K.-Y. Siu andJ. Bruck, On the power of threshold circuits with small weights,SIAM Journal on Discrete Mathematics 4(3) (1991) 423–435.Google Scholar
  17. [17]
    K.-Y. Siu and V. Roychowdhury, On optimal depth threshold circuits for multiplication and related problems, manuscript, 1992.Google Scholar
  18. [18]
    S. Toda, On the computational power ofPP and ⊗P, inProceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, 514–519.Google Scholar
  19. [19]
    A. Yao, Some complexity questions related to distributive computing, inProceedings of the 11th ACM Symposium on Theory of Computing, 1979, 209–213.Google Scholar
  20. [20]
    A. Yao, Lower bounds by probabilistic arguments, inProceedings of the 24th IEEE Symposium on Foundations of Computer Science, 1983, 420–428.Google Scholar
  21. [21]
    A. Yao, Circuits and local computation, inProceedings of the 21st ACM Symposium on Theory of Computing, 1989, 186–196.Google Scholar
  22. [22]
    A. Yao, OnACC and threshold circuits, inProceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, 619–627.Google Scholar

Copyright information

© Birkhäuser Verlag 1992

Authors and Affiliations

  • Mikael Goldmann
    • 1
  • Johan Håstad
    • 1
  • Alexander Razborov
    • 2
  1. 1.Department of Numerical Analysis and Computing ScienceRoyal Institute of TechnologyStockholmSWEDEN
  2. 2.Steklov Mathematical InstituteMoscowRUSSIA

Personalised recommendations