Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables

DOI10.1023/B:AURC.0000030905.86714.ACMaRDI QIDQ2487684zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 8 August 2005

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:aurc.0000030905.86714.ac

zbMATH Keywords

binary decision diagramspolynomial complexity

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Recommendations

• Efficient algorithms for the transformation between different types of binary decision diagrams
• scientific article; zbMATH DE number 2077136
• scientific article; zbMATH DE number 6292613
• On the computational power of linearly transformed BDDs
• Minimization of binary decision diagrams for systems of incompletely defined Boolean functions

Cited in

(9)

• Efficient algorithms for the transformation between different types of binary decision diagrams
• Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
• On the computational power of linearly transformed BDDs
• Geometric transformations of BDD encoded image
• scientific article; zbMATH DE number 2077136 (Why is no real title available?)
• Reduction of decision diagrams by disjunctive spectral translation in the Walsh-Hadamard domain
• scientific article; zbMATH DE number 6292613 (Why is no real title available?)
• Linearization of logical functions defined by a set of orthogonal terms. I: Theoretical aspects
• Classification of Boolean functions by the invariants of their matrix representation

This page was built for publication: Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables

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