TY - JOUR
T1 - Linear-size constant-depth polylog-threshold circuits
AU - Ragde, Prabhakar
AU - Wigderson, Avi
PY - 1991/8/16
Y1 - 1991/8/16
N2 - We present a simple explicit construction giving unbounded fan-in circuits with o(n) gates and depth O(r) for the threshold function of n variables when the threshold is at most (log n)r, for any integer r > 0. This improves a result of Ajtai and Ben-Or, who showed the existence of circuits of size no(1). This is the highest threshold for which polynomial-size, constant-depth circuits are possible.
AB - We present a simple explicit construction giving unbounded fan-in circuits with o(n) gates and depth O(r) for the threshold function of n variables when the threshold is at most (log n)r, for any integer r > 0. This improves a result of Ajtai and Ben-Or, who showed the existence of circuits of size no(1). This is the highest threshold for which polynomial-size, constant-depth circuits are possible.
KW - AC
KW - approximate compaction
KW - Computational complexity
KW - constant-depth circuits
KW - threshold circuits
UR - http://www.scopus.com/inward/record.url?scp=0026205731&partnerID=8YFLogxK
U2 - 10.1016/0020-0190(91)90110-4
DO - 10.1016/0020-0190(91)90110-4
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0026205731
SN - 0020-0190
VL - 39
SP - 143
EP - 146
JO - Information Processing Letters
JF - Information Processing Letters
IS - 3
ER -