✦ LIBER ✦

On the counting problem for monotone boolean functions

✍ Scribed by Harold N. Shapiro

Publisher: John Wiley and Sons
Year: 1970
Tongue: English
Weight: 500 KB
Volume: 23
Category: Article
ISSN: 0010-3640
DOI: 10.1002/cpa.3160230305

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the optimal evaluation of monotonic B

On the optimal evaluation of monotonic Boolean functions

✍ N.A. Sokolov 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 908 KB

The Rivest–Vuillemin Conjecture on Monot

The Rivest–Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables

✍ Sui-Xiang Gao; Weili Wu; Ding-Zhu Du; Xiao-Dong Hu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 177 KB

On the connection between linear inequal

On the connection between linear inequalities and monotonic boolean functions

✍ Yu.A. Zuev; V.N. Trishin 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 169 KB

On one criterion of the optihality of an

On one criterion of the optihality of an algorithm for evaluating monotonic boolean functions

✍ D.N. Gainanov 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 599 KB

The problem of finding the maximum upper

The problem of finding the maximum upper zero for a series of subclasses of monotonic Boolean functions

✍ N.N. Katerinochkina 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 670 KB

On Partial Classes Containig All Monoton

On Partial Classes Containig All Monotone and Zero-Preserving Total Boolean Functions

✍ Birger Strauch 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

## Abstract We describe sets of partial Boolean functions being closed under the operations of superposition. For any class __A__ of total functions we define the set 𝔐(__A__) consisting of all partial classes which contain precisely the functions of __A__ as total functions. The cardinalities of s