✦ LIBER ✦

Lower bounds on arithmetic circuits via partial derivatives

✍ Scribed by Noam Nisan; Avi Wigderson

Book ID: 105147648
Publisher: Springer
Year: 1996
Tongue: English
Weight: 883 KB
Volume: 6
Category: Article
ISSN: 1016-3328
DOI: 10.1007/bf01294256

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds on monotone arithmetic circ

Lower bounds on monotone arithmetic circuits with restricted depths

✍ Joseph JáJá 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 568 KB

Lower bounds on threshold and related ci

Lower bounds on threshold and related circuits via communication complexity

✍ Roychowdhury, V.P.; Orlitsky, A.; Kai-Yeung Siu 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 764 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

A lower bound for monotone arithmetic ci

A lower bound for monotone arithmetic circuits computing 0–1 permanent

✍ Rimli Sengupta; H. Venkateswaran 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 621 KB

A Lower Bound for the Size of Syntactica

A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits

✍ Raz, Ran; Shpilka, Amir; Yehudayoff, Amir 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 330 KB

Lower Bounds on the Depth of Monotone Ar

Lower Bounds on the Depth of Monotone Arithmetic Computations

✍ Don Coppersmith; Baruch Schieber 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 128 KB

dedicated to zvi galil's 50th birthday Consider an arithmetic expression of length n involving only the operations [+, \_] and non-negative constants. We prove lower bounds on the depth of any binary computation tree over the same sets of operations and constants that computes such an expression. We