Using CSP To Improve Deterministic 3-SAT

Details Using CSP To Improve Deterministic 3-SAT Using CSP To Improve Deterministic 3-SAT

2010-07-07

arxiv.org/abs/1007.1166v2

Computer Science

Data Structures and Algorithms

corrected typos, extended the introduction and added a notation section to make paper self-contained

Scientific paper

We show how one can use certain deterministic algorithms for higher-value
constraint satisfaction problems (CSPs) to speed up deterministic local search
for 3-SAT. This way, we improve the deterministic worst-case running time for
3-SAT to O(1.439^n).

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-345662