✦ LIBER ✦

A new lower bound on the monotone network complexity of Boolean sums

✍ Scribed by Ingo Wegener

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 3n-lower bound on the network complexi

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

An Ω(n43) lower bound on the monotone ne

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

Lower bounds on the area complexity of B

✍ Juraj Hromkovič; Sergej A. Ložkin; Andrej I. Rybko; Alexander A. Sapoženko; Nade 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

A2.5nlower bound on the monotone network

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

New lower bounds on the formula size of

✍ Ute Schürfeld 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 434 KB

A new lower bound on the expected size o

✍ Luke O'Connor 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 455 KB