Pith. sign in

REVIEW 1 cited by

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.09674 v1 pith:55NRJ5YJ submitted 2024-04-15 cs.DS cs.DBcs.FL

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata

Antoine Amarilli , Marcelo Arenas , YooJung Choi , Mika\"el Monet , Guy Van den Broeck , Benjie Wang This is my paper
classification cs.DS cs.DBcs.FL
keywords circuitsformalismsautomatabooleandecisiondiagramsbinarycircus
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On Computing Total Variation Distance Between Mixtures of Product Distributions

    cs.DS 2026-05 unverdicted novelty 6.0

    A randomized (1±ε)-approximation algorithm for TV distance between k-mixtures of product distributions runs in poly((nq)^k, 1/ε) time, with exact poly(n, 2^{O(k)}) deterministic algorithm for Boolean subcubes and #P-h...