✦ LIBER ✦

Complexity of realization of a linear Boolean function in Sheffer’s basis

✍ Scribed by Yu. A. Kombarov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Shortest 2-Basis for Boolean Algebra i

✍ Robert Veroff 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 66 KB

To the problem of realizability of Boole

✍ V. V. Tarasov 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 325 KB

Complexity of the realization of a linea

✍ V. M. Khrapchenko 📂 Article 📅 1971 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 196 KB

Bound on complexity of realization of a

✍ B. A. Muchnik 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 776 KB

On complexity of realisation of linear B

✍ Shkrebela, I. S. 📂 Article 📅 2003 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 175 KB

The Complexity of Deciding if a Boolean

✍ Heribert Vollmer 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 328 KB