An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
Data Structures and Algorithms
2025-12-04 v3
Abstract
Non-deterministic read-once branching programs, also known as non-deterministic free binary decision diagrams (nFBDD), are a fundamental data structure in computer science for representing Boolean functions. In this paper, we focus on #nFBDD, the problem of model counting for non-deterministic read-once branching programs. The #nFBDD problem is #P-hard, and it is known that there exists a quasi-polynomial randomized approximation scheme for #nFBDD. In this paper, we provide the first FPRAS for #nFBDD. Our result relies on the introduction of new analysis techniques that focus on bounding the dependence of samples.
Keywords
Cite
@article{arxiv.2406.16515,
title = {An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs},
author = {Kuldeep S. Meel and Alexis de Colnet},
journal= {arXiv preprint arXiv:2406.16515},
year = {2025}
}
Comments
Modified the proof of Lemmas 8 and 9 to fix a bug. Runtime of the algorithm is still polynomial