✦ LIBER ✦

Boolean functions with a simple certificate for CNF complexity

✍ Scribed by Ondřej Čepek; Petr Kučera; Petr Savický

Book ID: 113564626
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 329 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.05.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Realizing complex boolean functions with

Realizing complex boolean functions with simple groups

✍ Kenneth Krohn; W.D. Maurer; John Rhodes 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 284 KB

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

A compiler for simple boolean functions

A compiler for simple boolean functions of binary patterns

✍ J.R. Ullmann 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 528 KB

Inversion complexity of self-correcting

Inversion complexity of self-correcting circuits for a certain sequence of boolean functions

✍ Krasnova, T. I. 📂 Article 📅 2012 🏛 Allerton Press Inc 🌐 English ⚖ 999 KB

A Rigorous Complexity Analysis of the (1

A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs

✍ Droste, Stefan; Jansen, Thomas; Wegener, Ingo 📂 Article 📅 1998 🏛 MIT Press 🌐 English ⚖ 658 KB

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