On the computational power of binary decision diagram with redundant variables.

DOI10.1007/BF00121263MaRDI QIDQ960508zbMATH OpenFDO

Authors Tetsuya Yamada, Hiroto Yasuura

Publication date 21 December 2008

Published in Formal Methods in System Design (Search for Journal in Brave)

zbMATH Keywords

binary decision diagramcomputer-aided designdeterministic Turing machineDLOGindexed BDDinteger multiplier

Mathematics Subject Classification ID

Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On the size of binary decision diagrams representing Boolean functions
• BDDs -- design, analysis, complexity, and applications.
• Binary decision diagrams
• On the relation between BDDs and FDDs
• scientific article; zbMATH DE number 1948534

Cites work

• scientific article; zbMATH DE number 3898774 (Why is no real title available?)
• Binary Decision Diagrams
• Graph-Based Algorithms for Boolean Function Manipulation
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• On uniform circuit complexity

Cited in

(1)

• Chain reduction for binary and zero-suppressed decision diagrams

This page was built for publication: On the computational power of binary decision diagram with redundant variables.

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