A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
An ordered binary decision diagram (OBDD) is a graph representation of a Boolean function. We consider minimum OBDD identiÿcation problems: given positive and negative examples of a Boolean function, identify the OBDD with minimum number of nodes (or with minimum width) that is consistent with all the examples. We prove in this paper that the problems are NP-complete. The result implies that f(n)-width OBDD and f(n)-node OBDD are not learnable for some ÿxed f(n) under the PAC-learning modeldoi:10.1016/s0166-218x(99)00226-7 fatcat:5mjpej5qbncmrpuiyyl63w3iku