#CFG and #DNNF Admit FPRAS
arxiv（2024）
摘要
We provide the first fully polynomial-time randomized approximation scheme for the following two counting problems: 1. Given a Context Free Grammar G over alphabet Σ, count the number of words of length exactly n generated by G. 2. Given a circuit φ in Decomposable Negation Normal Form (DNNF) over the set of Boolean variables X, compute the number of assignments to X such that φ evaluates to 1.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要