On the OBDD-representation of general Boolean functions

DOI10.1109/12.144618MaRDI QIDQ5375349zbMATH OpenOpenAlexFDO

Authors Heh Tyan Liaw, Chen-Shang Lin

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

Mathematics Subject Classification ID

Logical aspects of Boolean algebras (03G05) Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25)

Cited in

(14)

• Efficient data structures for Boolean functions
• Size of ordered binary decision diagrams representing threshold functions
• On the evolution of the worst-case OBDD size
• Ordered binary decision diagrams and the Shannon effect
• On the use of binary decision diagrams for solving problems on simple games
• On the error resilience of ordered binary decision diagrams
• Better upper bounds on the QOBDD size of integer multiplication
• Constructing small tree grammars and small circuits for formulas
• OBDD minimization based on two-level representation of Boolean functions
• Lifting for simplicity: concise descriptions of convex sets
• Mathematical Foundations of Computer Science 2004
• The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions
• Quantum algorithm for finding the optimal variable ordering for binary decision diagrams
• Approximating Boolean functions by OBDDs

This page was built for publication: On the OBDD-representation of general Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375349)