✦ LIBER ✦

Generation of Boolean functions under the assumption of monotonicity

✍ Scribed by A. A. Voronenko, V. S. Fedorova

Book ID: 120894696
Publisher: Allerton Press, Inc.
Year: 2013
Tongue: English
Weight: 97 KB
Volume: 37
Category: Article
ISSN: 0278-6419
DOI: 10.3103/S0278641913010056

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the monotonicity of pseudo-Boo

A note on the monotonicity of pseudo-Boolean functions

✍ P. L. Hammer 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 146 KB

Partial decoding of monotonic Boolean fu

Partial decoding of monotonic Boolean functions

✍ A.N. Sokolov 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 352 KB

Optimal reconstruction of monotone Boole

Optimal reconstruction of monotone Boolean functions

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

Approximation of a partial boolean funct

Approximation of a partial boolean function by a monotonic boolean function

✍ Yu.A. Zuev 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 671 KB

Non-cancellative Boolean circuits: A gen

Non-cancellative Boolean circuits: A generalization of monotone boolean circuits

✍ Rimli Sengupta; H. Venkateswaran 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Cancellations are known to be helpful in e cient algebraic computation of polynomials over ÿelds. We deÿne a notion of cancellation in Boolean circuits and deÿne Boolean circuits that do not use cancellation to be non-cancellative. Non-cancellative Boolean circuits are a natural generalization of mo

The Monotone Circuit Complexity of Quadr

The Monotone Circuit Complexity of Quadratic Boolean Functions

✍ Kazuyuki Amano; Akira Maruoka 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 180 KB