On the Width of Ordered Binary Decision Diagrams

DOI10.1007/978-3-319-12691-3_33zbMath1431.68018OpenAlexW313952433MaRDI QIDQ2942417

Beate Bollig

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_33

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30) Data structures (68P05)

Related Items (4)

Second-Order Finite Automata ⋮ Second-order finite automata ⋮ On the minimization of (complete) ordered binary decision diagrams ⋮ On the width of regular classes of finite structures

This page was built for publication: On the Width of Ordered Binary Decision Diagrams