✦ LIBER ✦

Exponential Size Lower Bounds for Some Depth 3 Circuits

✍ Scribed by P.Y. Yan; I. Parberry

Book ID: 112252085
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 513 KB
Volume: 112
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1994.1054

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exponential lower bounds for depth three

Exponential lower bounds for depth three Boolean circuits

✍ R. Paturi; M. E. Saks; F. Zane 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 274 KB

Exponential lower bound for bounded dept

Exponential lower bound for bounded depth circuits with few threshold gates

✍ Vladimir V. Podolskii 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Exponential Lower Bounds for Depth 3 Ari

Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields

✍ D. Grigoriev; A. Razborov 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 184 KB

Optimal lower bounds on the depth of pol

Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions

✍ Ingo Wegener 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 176 KB

Top-down lower bounds for depth-three ci

Top-down lower bounds for depth-three circuits

✍ J. Håstad; S. Jukna; P. Pudlák 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 754 KB

An Exponential Lower Bound for the Size

An Exponential Lower Bound for the Size of Monotone Real Circuits

✍ Armin Haken; Stephen A. Cook 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

We prove a lower bound, exponential in the eighth root of the input length, on the size of monotone arithmetic circuits that solve an NP problem related to clique detection. The result is more general than the famous lower bound of Razborov and Andreev, because the gates of the circuit are allowed t