The complexity of minimizing and learning OBDDs and FBDDs
type: Item
instance of: scholarly article
title: The complexity of minimizing and learning OBDDs and FBDDs
zbMATH Open document ID: 1002.68032
DOI: 10.1016/S0166-218X(01)00324-9
author: Detlef Sieling
published in: Discrete Applied Mathematics
publication date: 2002-08-29T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1792366
zbMATH Keywords: ordered binary decision diagrams
zbMATH Keywords: free binary decision diagrams
MaRDI profile type: Publication
cites work: Q4230322
cites work: Improving the variable ordering of OBDDs is NP-complete
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Q4160379
cites work: Finding the optimal variable ordering for binary decision diagrams
cites work: Q4198056
cites work: Efficient Boolean manipulation with OBDD's can be extended to FBDD's
cites work: On the complexity of constructing optimal ordered binary decision diagrams
cites work: Optimization, approximation, and complexity classes
cites work: Computational limitations on learning from examples
cites work: The nonapproximability of OBDD minimization
cites work: Q4941907
cites work: Graph driven BDDs -- a new data structure for Boolean functions
cites work: Q4287364
cites work: Hardness of indentifying the minimum ordered binary decision diagram
cites work: Q4268445
cites work: A theory of the learnable
cites work: On the complexity of branching programs and decision trees for clique functions
cites work: Q3347300
description: scientific article; zbMATH DE number 1792366