2 citations · 4 across the 11 of their papers we have counts for
1 paper · 2 filters
Sanyam Agarwal, Gorav Jindal
Counting satisfying assignments of Boolean formulas is a basic problem in theoretical computer science, with $\#3\text{-}\SAT$ as the standard $\SharpP$-complete problem. More gene…