The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
From MaRDI portal
Publication:4419798
DOI10.1109/12.324559zbMath1068.68685OpenAlexW1977451125MaRDI QIDQ4419798
Publication date: 16 October 2003
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.324559
Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30) Boolean functions (94D10)
Related Items (11)
Ordered binary decision diagrams and the Shannon effect ⋮ Randomized OBDD-based graph algorithms ⋮ Better upper bounds on the QOBDD size of integer multiplication ⋮ Efficient data structures for Boolean functions ⋮ Randomized OBDD-Based Graph Algorithms ⋮ A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis ⋮ Processing succinct matrices and vectors ⋮ On the use of binary decision diagrams for solving problems on simple games ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ On the minimization of (complete) ordered binary decision diagrams ⋮ On the evolution of the worst-case OBDD size
This page was built for publication: The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
