A Full Derandomization of Schoening's k-SAT Algorithm

Details A Full Derandomization of Schoening's k-SAT Algorithm A Full Derandomization of Schoening's k-SAT Algorithm

2010-08-24

arxiv.org/abs/1008.4067v1

Computer Science

Data Structures and Algorithms

11 pages

Scientific paper

Schoening in 1999 presented a simple randomized algorithm for k-SAT with
running time O(a^n * poly(n)) for a = 2(k-1)/k. We give a deterministic version
of this algorithm running in time O((a+epsilon)^n * poly(n)), where epsilon > 0
can be made arbitrarily small.

Affiliated with

Also associated with

No associations

Rating

A Full Derandomization of Schoening's k-SAT Algorithm 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 A Full Derandomization of Schoening's k-SAT Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Full Derandomization of Schoening's k-SAT Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-394070