✦ LIBER ✦

The complexity of symmetric functions in bounded-depth circuits

✍ Scribed by Bettina Brustmann; Ingo Wegener

Book ID: 113163088
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 232 KB
Volume: 25
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90163-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounded-depth, polynomial-size circuits

Bounded-depth, polynomial-size circuits for symmetric functions

✍ Ronald Fagin; Maria M. Klawe; Nicholas J. Pippenger; Larry Stockmeyer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 787 KB

The complexity of computing symmetric fu

The complexity of computing symmetric functions using threshold circuits

✍ Paul Beame; Erik Brisson; Richard Ladner 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 811 KB

The circuit depth of symmetric boolean f

The circuit depth of symmetric boolean functions

✍ William F. McColl 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Lower bounds of the complexity of symmet

Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits

✍ A. A. Razborov 📂 Article 📅 1990 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 692 KB

The average sensitivity of bounded-depth

The average sensitivity of bounded-depth circuits

✍ Ravi B. Boppana 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 414 KB

The average sensitivity of a Boolean circuit is the expected number of input bits that, when flipped, change the output of the circuit, starting with a random input setting. We show that unbounded-fanin circuits of depth d and size s have average sensitivity 0( log s)~-'. This bound is asymptoticall

Negation-limited circuit complexity of s

Negation-limited circuit complexity of symmetric functions

✍ Keisuke Tanaka; Tetsuro Nishino; Robert Beals 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 710 KB