On the OBDD-representation of general Boolean functions
From MaRDI portal
Publication:5375349
DOI10.1109/12.144618zbMath1395.94400OpenAlexW2168881618MaRDI QIDQ5375349
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.144618
Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30) Logical aspects of Boolean algebras (03G05)
Related Items
Ordered binary decision diagrams and the Shannon effect, Lifting for Simplicity: Concise Descriptions of Convex Sets, Better upper bounds on the QOBDD size of integer multiplication, Efficient data structures for Boolean functions, Constructing small tree grammars and small circuits for formulas, On the use of binary decision diagrams for solving problems on simple games, Size of ordered binary decision diagrams representing threshold functions, The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions, On the evolution of the worst-case OBDD size, On the error resilience of ordered binary decision diagrams