✦ LIBER ✦

An n3/2 lower bound on the monotone network complexity of the Boolean convolution

✍ Scribed by Jürgen Weiss

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Ω(n43) lower bound on the monotone ne

✍ Norbert Blum 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 510 KB

A new lower bound on the monotone networ

✍ Ingo Wegener 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 282 KB

A 3n-lower bound on the network complexi

✍ C.P. Schnorr 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 972 KB

A 4n-lower bound on the monotone network

✍ Jürgen Tiekenheinrich 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 79 KB

A2.5nlower bound on the monotone network

✍ Paul E. Dunne 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 446 KB

An Ω(n4/3) lower bound on the randomized

✍ Péter Hajnal 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 657 KB