✦ LIBER ✦

Approximation of a partial boolean function by a monotonic boolean function

✍ Scribed by Yu.A. Zuev

Publisher: Elsevier Science
Year: 1978
Weight: 671 KB
Volume: 18
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(78)90149-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal reconstruction of monotone Boole

Optimal reconstruction of monotone Boolean functions

✍ N.A. Sokolov 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 644 KB

Fast sequential evaluation of monotonic

Fast sequential evaluation of monotonic Boolean functions

✍ I.K. Sethi 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 674 KB

On the optimal evaluation of monotonic B

On the optimal evaluation of monotonic Boolean functions

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

Monotonic Boolean functions and incompat

Monotonic Boolean functions and incompatible systems of inequalities

✍ V.N. Osipov 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 362 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

A Fast and Simple Algorithm for Identify

A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions

✍ Kazuhisa Makino; Toshihide Ibaraki‡ 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Consider the problem of identifying min T f and max F f of a positive i.e., . Ž . monotone Boolean function f, by using membership queries only, where min T f Ž Ž . . Ž . max F f denotes the set of minimal true vectors maximum false vectors of f. Ž Moreover, as the existence of a polynomial total t