The complexity of minimizing FBDDs. (Extended abstract)

DOI10.1007/3-540-48340-3_23MaRDI QIDQ4941907zbMATH OpenFDO

Authors Detlef Sieling

Publication date 19 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48340-3_23

Mathematics Subject Classification ID

Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The complexity of minimizing and learning OBDDs and FBDDs
• The complexity of minimal satisfiability problems
• scientific article; zbMATH DE number 1688380
• Complexity results on minimal unsatisfiable formulas
• On the minimization of (complete) ordered binary decision diagrams
• Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
• The complexity of some subclasses of minimal unsatisfiable formulas.
• scientific article; zbMATH DE number 1884382
• Minimization of free BDDs
• On the hardness of approximating the minimum consistent OBDD problem

Cited in

(4)

• The complexity of minimizing and learning OBDDs and FBDDs
• Free binary decision diagrams for the computation of \(\text{EAR}_{ n }\)
• scientific article; zbMATH DE number 1929956 (Why is no real title available?)
• Minimization of free BDDs

This page was built for publication: The complexity of minimizing FBDDs. (Extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941907)