12 citations · 34 across the 22 of their papers we have counts for
3 papers · 1 filter
A faster FPRAS for #NFA
Kuldeep S. Meel, Sourav Chakraborty, Umang Mathur
Given a non-deterministic finite automaton (NFA) A with m states, and a natural number n (presented in unary), the #NFA problem asks to determine the size of the set L(A_n) of word…
Total Variation Distance Meets Probabilistic Inference
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel +3
In this paper, we establish a novel connection between total variation (TV) distance estimation and probabilistic inference. In particular, we present an efficient, structure-prese…
Explaining SAT Solving Using Causal Reasoning
Jiong Yang, Arijit Shaw, Teodora Baluta +2
The past three decades have witnessed notable success in designing efficient SAT solvers, with modern solvers capable of solving industrial benchmarks containing millions of variab…