Abstract
We present an efficient reduction mapping undirected graphs G with n = 1k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 → {0, 1, ⊥} so that for any integer m, G has a vertex colouring using m colours if and only if g has a consistent ordered binary decision diagram with at most (2m + 2)n2 + 4n decision nodes. From this it follows that the problem of finding a minimum-sized consistent OBDD for an incompletely specified truth table is NP-hard and also hard to approximate. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Kristensen, J. T., & Miltersen, P. B. (2006). Finding small OBDDs for incompletely specified truth tables is hard. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4112 LNCS, pp. 489–496). Springer Verlag. https://doi.org/10.1007/11809678_51
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
