✦ LIBER ✦

A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions

✍ Scribed by Zwick, Uri

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the combinational complexity of certa

✍ Larry J. Stockmeyer 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 757 KB

A 3n-lower bound on the network complexi

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

Lower bounds of the complexity of symmet

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

A 4n-lower bound on the monotone network

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

A new lower bound on the expected size o

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

The lower bound on the second-order nonl

✍ Guanghong Sun; Chuankun Wu 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 143 KB