✦ LIBER ✦

Realization of Boolean functions by combinational circuits embedded in the hypercube

✍ Scribed by O. B. Sedelev

Book ID: 111510697
Publisher: Allerton Press, Inc.
Year: 2008
Tongue: English
Weight: 237 KB
Volume: 32
Category: Article
ISSN: 0278-6419
DOI: 10.3103/s11968-008-1007-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The depth of Boolean functions realized

The depth of Boolean functions realized by circuits over an arbitrary basis

✍ O. M. Kasim-Zade 📂 Article 📅 2007 🏛 Allerton Press Inc 🌐 English ⚖ 182 KB

To the problem of realizability of Boole

To the problem of realizability of Boolean functions by circuits in a basis of unreliable functional elements

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

Complexity of realization of Boolean fun

Complexity of realization of Boolean functions with small number of unit values by selfcorrecting contact circuits

✍ N. P. Red’kin 📂 Article 📅 2011 🏛 Allerton Press Inc 🌐 English ⚖ 916 KB

Sufficient conditions for realizability

Sufficient conditions for realizability of Boolean functions by asymptotically optimal circuits with the unreliability 2ɛ

✍ M. A. Alyokhina; A. V. Vasin 📂 Article 📅 2010 🏛 Allerton Press, Inc. 🌐 English ⚖ 519 KB

Realization of Boolean functions by repe

Realization of Boolean functions by repetition-free formulas in a particular base

✍ I. K. Sharankhaev 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 139 KB

On the Computation of Boolean Functions

On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In

✍ György Turán; Farrokh Vatan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 741 KB

We consider the complexity of computing Boolean functions by analog circuits of bounded fan-in, i.e., by circuits of gates computing real-valued functions, either exactly or as sign-representation. Sharp upper bounds are obtained for the complexity of the most difficult n-variable function over cert