A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata
Not on the map. Why?
Abstract (arXiv)
This document is an introduction to two related formalisms to define Boolean functions: binary decision diagrams, and Boolean circuits. It presents these formalisms and several of their variants studied in the setting of knowledge compilation. Last, it explains how these formalisms can be connected to the notions of automata over words and trees.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Apr 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 1.
3 papers.
- 2024A Compositional Atlas for Algebraic Circuitscited by 10
- 2024Restructuring Tractable Probabilistic Circuitscited by 7
- 2025On approximating the f-divergence between two Ising modelscited by 0
- 2025On approximating the f-divergence between two Ising models5 Sep 2025
- 2024A Compositional Atlas for Algebraic Circuits7 Dec 2024
- 2024Restructuring Tractable Probabilistic Circuits19 Nov 2024