✦ LIBER ✦

A minimal cutset of the boolean lattice with almost all members

✍ Scribed by Zoltán Füredi; Jerrold R. Griggs; Daniel J. Kleitman

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

On the greatest length of a dead-end dis

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

The density of a maximum minimal cut in

✍ Feng Shi; Weixuan Li 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 319 KB

Estimation of the length and the number

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

Joining with all members of a family sys

✍ Dale E. Bertram 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 624 KB

A comparison of the complexity of the lo

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