An Approximation Algorithm for #k-SAT

Details An Approximation Algorithm for #k-SAT An Approximation Algorithm for #k-SAT

2011-07-11

arxiv.org/abs/1107.2001v1

Computer Science

Data Structures and Algorithms

Scientific paper

We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximates #k-SAT for any k >= 3 within a running time that is not only non-trivial, but also significantly better than that of the currently fastest exact algorithms for the problem. More precisely, our algorithm is a randomized approximation scheme whose running time depends polynomially on the error tolerance and is mildly exponential in the number n of variables of the input formula. For example, even stipulating sub-exponentially small error tolerance, the number of solutions to 3-CNF input formulas can be approximated in time O(1.5366^n). For 4-CNF input the bound increases to O(1.6155^n). We further show how to obtain upper and lower bounds on the number of solutions to a CNF formula in a controllable way. Relaxing the requirements on the quality of the approximation, on k-CNF input we obtain significantly reduced running times in comparison to the above bounds.

Affiliated with

Also associated with

No associations

Rating

An Approximation Algorithm for #k-SAT does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Approximation Algorithm for #k-SAT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Approximation Algorithm for #k-SAT will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137665