Efficient algorithms for the transformation between different types of binary decision diagrams

DOI10.1007/s002360050083zbMath0877.68049OpenAlexW2005670844MaRDI QIDQ1357805

Petr Savický, Ingo Wegener

Publication date: 8 December 1997

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050083

zbMATH Keywords

free binary decision diagram

Mathematics Subject Classification ID

Related Items

Deterministic identity testing for sum of read-once oblivious arithmetic branching programs ⋮ Properties of Switch-List Representations of Boolean Functions ⋮ The nonapproximability of OBDD minimization