nω(log n) lower bounds on the size of depth-3 threshold cicuits with AND gates at the bottom

Alexander Razborov*, Avi Wigderson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

52 Scopus citations

Abstract

We present a function in ACC0 such that any depth-3 threshold circuit which computes this function and has AND gates at the bottom must have size nω(log n).

Original languageEnglish
Pages (from-to)303-307
Number of pages5
JournalInformation Processing Letters
Volume45
Issue number6
DOIs
StatePublished - 16 Apr 1993

Keywords

  • Computational complexity
  • lower bounds
  • threshold circuits

Fingerprint

Dive into the research topics of 'nω(log n) lower bounds on the size of depth-3 threshold cicuits with AND gates at the bottom'. Together they form a unique fingerprint.

Cite this