Work

OBDDs, SDDs, and circuits of bounded width: Completeness matters

Year: 2025

Type: article

Abstract: Ordered Binary Decision Diagrams (OBDDs) are dynamic data structures with many application areas. The literature suggested that OBDDs of bounded width equate to Boolean circuits of bounded pathwidth. In this paper, we show that this relationship holds only for complete OBDDs. Additionally, we demonstrate that similar limitations affect the claimed equivalence between Sentential Decision Diagrams (SDDs) of bounded width and Boolean circuits of bounded treewidth.

Source: Artificial Intelligence

DOI: 10.1016/j.artint.2025.104458

Authors: Alexis De Colnet, Sebastian Ordyniak, Stefan Szeider

Institutions: TU Wien, University of Leeds

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $4,260

Funders: Vienna Science and Technology Fund, Austrian Science Fund, Engineering and Physical Sciences Research Council