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

Alexander Razborov; Avi Wigderson

doi:10.1016/0020-0190(93)90041-7

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

The Rachel and Selim Benin School of Engineering and Computer Science

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

56 Scopus citations

Abstract

We present a function in ACC⁰ 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 language	English
Pages (from-to)	303-307
Number of pages	5
Journal	Information Processing Letters
Volume	45
Issue number	6
DOIs	https://doi.org/10.1016/0020-0190(93)90041-7
State	Published - 16 Apr 1993

Keywords

Computational complexity
lower bounds
threshold circuits

Access to Document

10.1016/0020-0190(93)90041-7

Cite this

@article{88e5a5732afd4438b1378a1551af5326,

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

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).",

keywords = "Computational complexity, lower bounds, threshold circuits",

author = "Alexander Razborov and Avi Wigderson",

year = "1993",

month = apr,

day = "16",

doi = "10.1016/0020-0190(93)90041-7",

language = "אנגלית",

volume = "45",

pages = "303--307",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

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

AU - Razborov, Alexander

AU - Wigderson, Avi

PY - 1993/4/16

Y1 - 1993/4/16

N2 - 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).

AB - 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).

KW - Computational complexity

KW - lower bounds

KW - threshold circuits

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

U2 - 10.1016/0020-0190(93)90041-7

DO - 10.1016/0020-0190(93)90041-7

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0000347859

SN - 0020-0190

VL - 45

SP - 303

EP - 307

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this