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

DOI10.1007/BF00121263zbMath1425.68118MaRDI QIDQ960508

Tetsuya Yamada, Hiroto Yasuura

Publication date: 21 December 2008

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

zbMATH Keywords

computer-aided designbinary decision diagramdeterministic Turing machineDLOGindexed BDDinteger multiplier

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On uniform circuit complexity
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams