A note on the simulation of exponential threshold weights

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1090, Issue , 1996, Pages 136-141

  Hofmeister, Thomas ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; THRESHOLD ELEMENTS;

INTEGER WEIGHTS; POLYNOMIAL SIZE; THRESHOLD CIRCUITS; THRESHOLD GATES;

COMPUTER CIRCUITS;

EID: 84948947981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61332-3_146     Document Type: Conference Paper

References (4)

1. [GHR] M. Goldmann, J. Håstad, A. Razborov, Majority gates vs. general weighted threshold gates, Proceedings of 7th Annual Structure in Complexity Theory Conference (1992), pp. 2-13.
2. [GK] M. Goldmann, M. Karpinski, Simulating Threshold Circuits by Majority Circuits, STOC 1993, p. 551-560.
3. [H] T. Hofmeister, Depth-efficient threshold circuits for arithmetic functions, Chap. 2 in: Theoretical Advances in Neural Computation and Learning, V. Roychowdhury, K-Y. Siu, and A. Orlitsky (eds.), Kluwer Academic Publ.
4. [M] S. Muroga, Threshold logic and its applications, John Wiley, New York, 1971.