On the Hardness of Approximating the Minimum Consistent OBDD Problem.
Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings,
, pp.112-123
(1996), [peer-reviewed]
Event Date:
July 3-5, 1996
Abstract / 概要
Ordered binary decision diagrams (OBDDs, for short) represent Boolean functions as directed acyclic graphs. The minimum consistent OBDD problem is, given an incomplete truth table of a function, to find the smallest OBDD that is consistent with the truth table with…