✦ LIBER ✦

A comparison of the complexity of the longest and shortest disjunctive normal forms and a lower bound for the number of prime disjunctive normal forms for almost all Boolean functions

✍ Scribed by A. D. Korshunov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The upper complexity bound of the shorte

✍ A. D. Korshunov 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 552 KB

Estimation of the length and the number

✍ A. A. Sapozhenko 📂 Article 📅 1980 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 681 KB

On lower bounds for the complexity of di

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

On the greatest length of a dead-end dis

✍ A. A. Sapozhenko 📂 Article 📅 1968 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 334 KB

A method for simplifying the disjunctive

✍ F. I. Andon 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 331 KB

The principle of raising the degree of i

✍ Yu. N. Kornev 📂 Article 📅 1971 🏛 Springer US 🌐 English ⚖ 638 KB