✦ LIBER ✦

Comparative analysis of the complexity of boolean functions with a small number of zeros

✍ Scribed by Yu. V. Maximov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Disjunctive normal forms of Boolean func

✍ A.Yu. Kogan 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 444 KB

On lower bounds for the complexity of di

✍ A.Yu. Kogan 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 510 KB

Maximal faces of Boolean functions with

✍ M. Yu. Romanov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 186 KB

Efficient construction of DNF for some b

✍ M. Yu. Romanov 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 156 KB

Simple disjunctive normal forms of Boole

✍ Yu. V. Maximov 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 148 KB

Complexity of realization of Boolean fun

✍ N. P. Red’kin 📂 Article 📅 2011 🏛 Allerton Press Inc 🌐 English ⚖ 916 KB