✦ LIBER ✦

Testing Basic Boolean Formulae

✍ Scribed by Parnas, Michal; Ron, Dana; Samorodnitsky, Alex

Book ID: 118198068
Publisher: Society for Industrial and Applied Mathematics
Year: 2002
Tongue: English
Weight: 318 KB
Volume: 16
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480101407444

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Size-depth tradeoffs for Boolean formula

Size-depth tradeoffs for Boolean formulae

✍ Maria Luisa Bonet; Samuel R. Buss 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Sensitivity of Boolean formulas

✍ Creignou, Nadia; Daudé, Hervé 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 414 KB

DNA-based algorithms for learning Boolea

DNA-based algorithms for learning Boolean formulae

✍ Yasubumi Sakakibara 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 136 KB

On the readability of monotone Boolean f

On the readability of monotone Boolean formulae

✍ Khaled Elbassioni; Kazuhisa Makino; Imran Rauf 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 505 KB

Variable and term removal from Boolean f

Variable and term removal from Boolean formulae

✍ Yves Crama; Oya Ekin; Peter L Hammer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 921 KB

Given a Boolean formula in disjunctive normal form, the variable deletion control set problem consists in finding a minimum cardinality set of variables whose deletion from the formula results in a DNF satisfying some prescribed property. Similar problems can be defined with respect to the fixation

Size-depth tradeoff in monotone Boolean

Size-depth tradeoff in monotone Boolean formulae

✍ Beate Commentz-Walter 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 563 KB