A Note on Deterministic Approximate Counting for k-DNF
Luca Trevisan · 2002
We describe a deterministic algorithm that, for constant k, given a k-DNF or k-CNF formula ϕ and a parameter ε, runs in time linear in the size of ϕ and polynomial in 1/ε and returns an estimate of the fraction of satisfying assignments for ϕ up to an additive error ε. For k-DNF, a multiplicative approximation is also achievable in time polynomial in 1/ε and linear in the size of ϕ. Previous algorithms achieved polynomial (but not linear) dependency on the size of ϕ and on 1/ε; their dependency on k, however, was much better than ours. Unlike previous algorithms, our algorithm is not based on derandomization techniques, and it is quite similar to an algorithm by Hirsch for the related problem of solving k-SAT under the promise that an ε-fraction of the assignments are satisfying. Our analysis is different from (and somewhat simpler than) Hirsch’s. 1