✦ LIBER ✦

The Monotone Circuit Complexity of Quadratic Boolean Functions

✍ Scribed by Kazuyuki Amano; Akira Maruoka

Publisher: Springer
Year: 2006
Tongue: English
Weight: 180 KB
Volume: 46
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-006-0073-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of single dynamic tests for m

Complexity of single dynamic tests for monotone Boolean functions

✍ V. A. Vardanyan 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 352 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

Optimal reconstruction of monotone Boole

Optimal reconstruction of monotone Boolean functions

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

Compositional complexity of Boolean func

Compositional complexity of Boolean functions

✍ Harold Abelson; Andrzej Ehrenfeucht; James Fickett; Jan Mycielski 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 549 KB

Sperner type theorems and complexity of

Sperner type theorems and complexity of minimal disjunctive normal forms of monotone boolean functions

✍ H. -D. O. F. Gronau 📂 Article 📅 1981 🏛 Springer Netherlands 🌐 English ⚖ 678 KB

The circuit depth of symmetric boolean f

The circuit depth of symmetric boolean functions

✍ William F. McColl 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 354 KB