An fpras for model counting for non-deterministic Read-once branching programs

DOI10.4230/LIPICS.ICDT.2025.30MaRDI QIDQ7292800zbMATH OpenFDO

Authors Kuldeep S. Meel, Alexis de Colnet

Publication date 8 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2025.30

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• A quasi-polynomial-time algorithm for sampling words from a context-free language
• Binary Decision Diagrams
• Branching Programs and Binary Decision Diagrams
• Conjunctive queries on probabilistic graphs: the limits of approximability
• Connecting knowledge compilation classes and width parameters
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 910913 (Why is no real title available?)
• Knowledge compilation meets database theory: compiling queries to decision diagrams
• The Complexity of Enumeration and Reliability Problems
• When is approximate counting for conjunctive queries tractable?

This page was built for publication: An fpras for model counting for non-deterministic Read-once branching programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292800)