DocumentCode
3151797
Title
Majority gates vs. general weighted threshold gates
Author
Goldmann, Mikael ; Håstad, Johan ; Razborov, Alexander
Author_Institution
R. Inst. of Technol., Stockholm, Sweden
fYear
1992
fDate
22-25 Jun 1992
Firstpage
2
Lastpage
13
Abstract
Small-depth circuits that contain threshold gates (with or without weights) and parity gates are studied. All circuits considered are of polynomial size. Several results that complete the work of characterizing possible inclusions between many classes defined by small-depth circuits are proved
Keywords
computational complexity; logic gates; majority logic; threshold elements; threshold logic; majority gates; parity gates; polynomial size gates; small-depth circuits; weighted threshold gates; Circuits; Computational modeling; Computer science; Neural networks; Neurofeedback; Physics computing; Polynomials; Wires;
fLanguage
English
Publisher
ieee
Conference_Titel
Structure in Complexity Theory Conference, 1992., Proceedings of the Seventh Annual
Conference_Location
Boston, MA
Print_ISBN
0-8186-2955-X
Type
conf
DOI
10.1109/SCT.1992.215375
Filename
215375
Link To Document