On the evolution of the worst-case OBDD size

DOI10.1016/S0020-0190(00)00148-4zbMath1003.68050OpenAlexW2030998711MaRDI QIDQ1607073

Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav

Publication date: 25 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00148-4

zbMATH Keywords

Boolean function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Ordered binary decision diagrams and the Shannon effect ⋮ A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams

Uses Software

• CUDD

Cites Work

• Unnamed Item
• Unnamed Item
• On the size of binary decision diagrams representing Boolean functions
• Graph driven BDDs -- a new data structure for Boolean functions
• Graph-Based Algorithms for Boolean Function Manipulation
• Efficient Boolean manipulation with OBDD's can be extended to FBDD's
• The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
• Least upper bounds on OBDD sizes
• On the OBDD-representation of general Boolean functions

This page was built for publication: On the evolution of the worst-case OBDD size