Learning ordered binary decision diagrams [chapter]

Ricard Gavaldà, David Guijarro
1995 Lecture Notes in Computer Science  
This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that nds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output, unless P=NP. If learning has to occur with respect to the optimal variable ordering, polynomial-time learnability implies the
more » ... of two NP-hard optimization problems: the problem of nding the optimal variable ordering for a given obdd and the Optimal Linear Arrangement problem on graphs.
doi:10.1007/3-540-60454-5_41 fatcat:p54oje5hdbhojenmhnxi6iy32q