Derandomizing HSSW Algorithm for 3-SAT

Details Derandomizing HSSW Algorithm for 3-SAT Derandomizing HSSW Algorithm for 3-SAT

2011-02-18

arxiv.org/abs/1102.3766v1

Computer Science

Computational Complexity

11 pages

Scientific paper

We present a (full) derandomization of HSSW algorithm for 3-SAT, proposed by
Hofmeister, Sch\"oning, Schuler, and Watanabe in [STACS'02]. Thereby, we obtain
an O(1.3303^n)-time deterministic algorithm for 3-SAT, which is currently
fastest.

Affiliated with

Also associated with

No associations

Rating

Derandomizing HSSW Algorithm for 3-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 Derandomizing HSSW Algorithm for 3-SAT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Derandomizing HSSW Algorithm for 3-SAT will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-211599