✦ LIBER ✦

Sperner type theorems and complexity of minimal disjunctive normal forms of monotone boolean functions

✍ Scribed by H. -D. O. F. Gronau

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

A comparison of the complexity of the lo

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

On lower bounds for the complexity of di

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

The best local algorithm for constructin

✍ G.F. Losev 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 743 KB

Estimation of the length and the number

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

The principle of raising the degree of i

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