메뉴 건너뛰기




Volumn 152, Issue 1, 1999, Pages 62-73

Efficient Threshold Circuits for Power Series

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0346498323     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2783     Document Type: Article
Times cited : (10)

References (14)
  • 2
    • 0022811668 scopus 로고
    • Log depth circuits for division and related problems
    • Beame, P. W., Cook, S. A., and Hoover, H. J. (1986), Log depth circuits for division and related problems, SIAM J. Comput. 15, 994-1003.
    • (1986) SIAM J. Comput. , vol.15 , pp. 994-1003
    • Beame, P.W.1    Cook, S.A.2    Hoover, H.J.3
  • 4
    • 0000069809 scopus 로고
    • Majority gates vs. general weighted threshold gates
    • Goldmann, M., Håstad, J., and Razborov, A. (1992), Majority gates vs. general weighted threshold gates, Comput. Complexity 2, 277-300.
    • (1992) Comput. Complexity , vol.2 , pp. 277-300
    • Goldmann, M.1    Håstad, J.2    Razborov, A.3
  • 7
    • 0346703293 scopus 로고    scopus 로고
    • Threshold circuits of small majority-depth
    • Maciel, A., and Thérien, D. (1998), Threshold circuits of small majority-depth, Inform. and Comput. 146, 55-83.
    • (1998) Inform. and Comput. , vol.146 , pp. 55-83
    • Maciel, A.1    Thérien, D.2
  • 8
    • 85030058836 scopus 로고    scopus 로고
    • Efficient Threshold Circuits for Power Series
    • School of Computer Science, McGill University, Montréal, Québec, Canada
    • Maciel, A., and Thérien, D. (1998), "Efficient Threshold Circuits for Power Series," Technical Report SOCS-98.1, School of Computer Science, McGill University, Montréal, Québec, Canada.
    • (1998) Technical Report SOCS-98.1
    • Maciel, A.1    Thérien, D.2
  • 9
    • 0347909227 scopus 로고
    • Neural networks and complexity theory
    • Orponen, P. (1994), Neural networks and complexity theory, Nordic J. Comput. 1, 94-110.
    • (1994) Nordic J. Comput. , vol.1 , pp. 94-110
    • Orponen, P.1
  • 10
    • 0242511413 scopus 로고
    • A primer on the complexity theory of neural networks
    • "Formal Techniques in Artificial Intelligence: A Sourcebook" (R. B. Banerji, Ed.), North-Holland, Amsterdam
    • Parberry, I. (1990), A primer on the complexity theory of neural networks, in "Formal Techniques in Artificial Intelligence: A Sourcebook" (R. B. Banerji, Ed.), pp. 217-268, Studies in Computer Science and Artificial Intelligence, Vol. 6, North-Holland, Amsterdam.
    • (1990) Studies in Computer Science and Artificial Intelligence , vol.6 , pp. 217-268
    • Parberry, I.1
  • 11
    • 0026932814 scopus 로고
    • On threshold circuits and polynomial computation
    • Reif, J. H., and Täte, S. R. (1992), On threshold circuits and polynomial computation, SIAM J. Comput. 21, 896-908.
    • (1992) SIAM J. Comput. , vol.21 , pp. 896-908
    • Reif, J.H.1    Täte, S.R.2
  • 12
  • 13
    • 0001293189 scopus 로고
    • On optimal depth threshold circuits for multiplication and related problems
    • Siu, K.-Y., and Roychowdhury, V. (1994), On optimal depth threshold circuits for multiplication and related problems, SIAM J. Discrete Math. 7, 284-292.
    • (1994) SIAM J. Discrete Math. , vol.7 , pp. 284-292
    • Siu, K.-Y.1    Roychowdhury, V.2


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