Linear-size constant-depth polylog-threshold circuits

Prabhakar Ragde; Avi Wigderson

doi:10.1016/0020-0190(91)90110-4

Linear-size constant-depth polylog-threshold circuits

Prabhakar Ragde^*
, Avi Wigderson

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

18 Scopus citations

Abstract

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 n^o(1). This is the highest threshold for which polynomial-size, constant-depth circuits are possible.

Original language	English
Pages (from-to)	143-146
Number of pages	4
Journal	Information Processing Letters
Volume	39
Issue number	3
DOIs	https://doi.org/10.1016/0020-0190(91)90110-4
State	Published - 16 Aug 1991

Keywords

AC
Computational complexity
approximate compaction
constant-depth circuits
threshold circuits

Access to Document

10.1016/0020-0190(91)90110-4

Cite this

@article{3d4f86d3e62c4e6fbc4085beaf38db0d,

title = "Linear-size constant-depth polylog-threshold circuits",

abstract = "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.",

keywords = "AC, Computational complexity, approximate compaction, constant-depth circuits, threshold circuits",

author = "Prabhakar Ragde and Avi Wigderson",

year = "1991",

month = aug,

day = "16",

doi = "10.1016/0020-0190(91)90110-4",

language = "אנגלית",

volume = "39",

pages = "143--146",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "3",

}

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 - Computational complexity

KW - approximate compaction

KW - constant-depth circuits

KW - threshold circuits

UR - https://www.scopus.com/pages/publications/0026205731

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 -

Linear-size constant-depth polylog-threshold circuits

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this