✦ LIBER ✦

A method for simplifying the disjunctive normal form (DNF) of boolean functions

✍ Scribed by F. I. Andon

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local algorithms simplifying the disjunc

✍ A.V. Kabulov; G.F. Losev 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 534 KB

On the greatest length of a dead-end dis

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

Disjunctive normal forms of Boolean func

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

A comparison of the complexity of the lo

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

A method of synthesizing planar disjunct

✍ Yu.A. Mamatov 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 191 KB

The upper complexity bound of the shorte

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