✦ LIBER ✦

Linear-size constant-depth polylog-threshold circuits

✍ Scribed by Prabhakar Ragde; Avi Wigderson

Book ID: 103106725
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 461 KB
Volume: 39
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90110-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Size--Depth Tradeoffs for Threshold Circ

Size--Depth Tradeoffs for Threshold Circuits

✍ Impagliazzo, Russell; Paturi, Ramamohan; Saks, Michael E. 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 362 KB

Uniform constant-depth threshold circuit

Uniform constant-depth threshold circuits for division and iterated multiplication

✍ William Hesse; Eric Allender; David A. Mix Barrington 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 258 KB

known since the mid-1980s (SIAM J. Comput. 15 (1986) 994; SIAM J. Comput. 21 (1992) 896) that integer division can be performed by poly-time uniform constantdepth circuits of Majority gates; equivalently, the division problem lies in P-uniform TC 0 : Recently, this was improved to L-uniform TC 0 (RA

Permanent does not have succinct polynom

Permanent does not have succinct polynomial size arithmetic circuits of constant depth

✍ Maurice Jansen; Rahul Santhanam 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 287 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