𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of Boolean formula minimization

✍ Scribed by David Buchfuhrer; Christopher Umans

Book ID
108166602
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
206 KB
Volume
77
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Auto
[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 5125 || The Complexity of Boolean Formula Minimization
✍ Aceto, Luca; DamgΓ₯rd, Ivan; Goldberg, Leslie Ann; HalldΓ³rsson, MagnΓΊs M.; IngΓ³lf πŸ“‚ Article πŸ“… 2008 πŸ› Springer Berlin Heidelberg 🌐 English βš– 462 KB

The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully rev

The Minimization Problem for Boolean For
The Minimization Problem for Boolean Formulas
✍ Hemaspaandra, Edith; Wechsung, Gerd πŸ“‚ Article πŸ“… 2002 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 169 KB