Counting good truth assignments of random k-SAT formulae

Details Counting good truth assignments of random k-SAT formulae Counting good truth assignments of random k-SAT formulae

2006-07-14

arxiv.org/abs/cs/0607073v1

Computer Science

Discrete Mathematics

13 pages, 1 eps figure

Scientific paper

We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial time (by `good' we mean that violate a small fraction of clauses). The relative error is bounded above by an arbitrarily small constant epsilon with high probability as long as the clause density (ratio of clauses to variables) alpha

Affiliated with

Also associated with

No associations

Rating

Counting good truth assignments of random k-SAT formulae 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 Counting good truth assignments of random k-SAT formulae, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting good truth assignments of random k-SAT formulae will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96349