On the computational power of linearly transformed BDDs

DOI10.1016/S0020-0190(00)00083-1zbMATH Open1338.68073DBLPjournals/ipl/GuntherD00WikidataQ59243039 ScholiaQ59243039MaRDI QIDQ294813FDOQ294813

Authors: Wolfgang Günther, Rolf Drechsler 

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000831?np=y

Recommendations

• Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables
• Lower bounds for linearly transformed OBDDs and FBDDs
• BDDs -- design, analysis, complexity, and applications.
• scientific article; zbMATH DE number 1500660
• A comparison of free BDDs and transformed BDDs

zbMATH Keywords

data structurescomputational powerlinear transformationBDD

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication

Cited In (3)

• Lower bounds for linearly transformed OBDDs and FBDDs
• Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables
• Geometric transformations of BDD encoded image

This page was built for publication: On the computational power of linearly transformed BDDs

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