Least upper bounds on OBDD sizes

DOI10.1109/12.286311zbMath1033.68682OpenAlexW2107864677MaRDI QIDQ4420060

Mark A. Heap, M. R. Mercer

Publication date: 13 August 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.286311

zbMATH Keywords

data compressionordered binary decision diagramsBollean function representation

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07)

Related Items (4)

Ordered binary decision diagrams and the Shannon effect ⋮ Constructing small tree grammars and small circuits for formulas ⋮ A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams ⋮ On the evolution of the worst-case OBDD size

This page was built for publication: Least upper bounds on OBDD sizes