메뉴 건너뛰기
Computational Complexity
Volumn 2, Issue 4, 1992, Pages 277-300
Majority gates vs. general weighted threshold gates
Author keywords

circuit complexity; lower bounds; majority circuits; Subject classifications: 68Q15; threshold circuits
Indexed keywords

EID: 0000069809     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/BF01200426     Document Type: Article
Times cited : (152)
References (22)
  • 1
    • 84934252928 scopus 로고    scopus 로고
    • E. Allender, A note on the power of threshold circuts, in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, 580–584.
  • 3
    • 84934252927 scopus 로고    scopus 로고
    • J. Bruck and R. Smolensky, Polynomial threshold functions, AC0 functions and spectral norms, in Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, 632–641.
  • 4
    • 84934252940 scopus 로고    scopus 로고
    • Y. Freund, Boosting a weak learning algorithm by majority, in Workshop on Computational Learning Theory, Morgan Kaufmann, 1990, 202–216.
  • 5
    • 84934252942 scopus 로고    scopus 로고
    • M. Goldmann and M. Karpinski, Constructing depth d+1 majority circuits that simulate depth d threshold circuits, manuscript, 1992.
  • 6
    • 84934252941 scopus 로고    scopus 로고
    • A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, and G. Turán, Threshold circuits of bounded depth, in Proceedings of 28 IEEE Symposium on Foundations of Computer Science, 1987, 99–110.
  • 7
    • 84934252944 scopus 로고    scopus 로고
    • J. Håstad and M. Goldmann, On the power of small-depth threshold circuits, in Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, 610–618.
  • 8
    • 84934252943 scopus 로고    scopus 로고
    • J. Hertz, R. Krogh, and A. Palmer, An Introduction to the Theory of Neural Computation, Addison-Wesley, 1991.
  • 9
    • 84934252946 scopus 로고    scopus 로고
    • M. Hofri, Probabilistic Analysis of Algorithms, Springer-Verlag, 1987.
  • 10
    • 84934252945 scopus 로고    scopus 로고
    • M. Krause, Geometric arguments yield better bounds for threshold circuits and distributed computing, in Proceedings of the 6th Structure in Complexity Theory Conference, 1991, 314–322.
  • 11
    • 84934252938 scopus 로고    scopus 로고
    • M. Krause and S. Waack, Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fanin, in Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991, 777–782.
  • 12
    • 84934252937 scopus 로고    scopus 로고
    • W. Maass, G. Schnitger, and E. Sontag, On the computational power of sigmoid versus boolean threshold circuits, in Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991, 767–776.
  • 13
    • 84934252939 scopus 로고    scopus 로고
    • S. Muroga, Threshold logic and its applications, Wiley-Interscience, 1971.
  • 15
    • 84934253000 scopus 로고    scopus 로고
    • G. Owen, Game theory, Academic press, second edition, 1982.
  • 17
    • 84934253002 scopus 로고    scopus 로고
    • K.-Y. Siu and V. Roychowdhury, On optimal depth threshold circuits for multiplication and related problems, manuscript, 1992.
  • 18
    • 84934253001 scopus 로고    scopus 로고
    • S. Toda, On the computational power of PP and ⊗P, in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, 514–519.
  • 19
    • 84934252991 scopus 로고    scopus 로고
    • A. Yao, Some complexity questions related to distributive computing, in Proceedings of the 11th ACM Symposium on Theory of Computing, 1979, 209–213.
  • 20
    • 84934252992 scopus 로고    scopus 로고
    • A. Yao, Lower bounds by probabilistic arguments, in Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, 1983, 420–428.
  • 21
    • 84934252989 scopus 로고    scopus 로고
    • A. Yao, Circuits and local computation, in Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, 186–196.
  • 22
    • 84934252990 scopus 로고    scopus 로고
    • A. Yao, On ACC and threshold circuits, in Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, 619–627.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.