✦ LIBER ✦

Replaceability and computational equivalence for monotone boolean functions

✍ Scribed by Meurig Beynon

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the counting problem for monotone boo

✍ Harold N. Shapiro 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 500 KB

Complexity of single dynamic tests for m

✍ V. A. Vardanyan 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 352 KB

The equivalence of Horn and network comp

✍ Stal O. Anderaa; Egon Börger 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 268 KB

Connection-graph and iteration-graph of

✍ Y. Robert; M. Tchuente 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Monotonic Boolean functions and incompat

✍ V.N. Osipov 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 362 KB

Computer experiments to find the minimum

✍ V.G. Ustyuzhaninov 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 723 KB