Linear-size constant-depth polylog-threshold circuits

Prabhakar Ragde*, Avi Wigderson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-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 no(1). This is the highest threshold for which polynomial-size, constant-depth circuits are possible.

Original languageEnglish
Pages (from-to)143-146
Number of pages4
JournalInformation Processing Letters
Volume39
Issue number3
DOIs
StatePublished - 16 Aug 1991

Keywords

  • AC
  • approximate compaction
  • Computational complexity
  • constant-depth circuits
  • threshold circuits

Fingerprint

Dive into the research topics of 'Linear-size constant-depth polylog-threshold circuits'. Together they form a unique fingerprint.

Cite this