An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem

摘要

We propose a simple idea for improving the randomized algorithm of Hertli for the Unique 3SAT problem. Using recently developed techniques, we can derive from this algorithm the currently the fastest randomized algorithm for the general 3SAT problem. Though the efficiency improvement is extremely small, we hope that this idea would lead to better improvements.