✦ LIBER ✦

Communication complexity towards lower bounds on circuit depth

✍ Scribed by J. Edmonds; R. Impagliazzo; S. Rudich; J. Sgall

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds on the Multiparty Communica

✍ Pavol Ďuriš; José D.P. Rolim 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Super-logarithmic depth lower bounds via

✍ Mauricio Karchmer; Ran Raz; Avi Wigderson 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 765 KB

Communication in bounded depth circuits

✍ P. Pudlák 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 682 KB

Lower Bounds on the Randomized Communica

✍ Nikos Leonardos; Michael Saks 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 583 KB

Top-down lower bounds for depth-three ci

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

Exponential lower bounds for depth three

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