✦ LIBER ✦

The complexity of computing symmetric functions using threshold circuits

✍ Scribed by Paul Beame; Erik Brisson; Richard Ladner

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing threshold functions by depth-3

✍ Stasys Jukna 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 326 KB

Negation-limited circuit complexity of s

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

Time-space tradeoffs for computing funct

✍ Martin Tompa 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 898 KB

The circuit depth of symmetric boolean f

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

The communication complexity of computin

✍ Pengyuan Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 742 KB

Efficient computation of radial moment f

✍ Chong-Yaw Wee; Raveendran Paramesran 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 330 KB