Elsevier

Theoretical Computer Science

Volume 806, 2 February 2020, Pages 70-80
Theoretical Computer Science

An improvement of the algorithm of Hertli for the unique 3SAT problem

https://doi.org/10.1016/j.tcs.2018.11.023Get rights and content
Under an Elsevier user license
open archive

Abstract

We propose a simple idea for improving the randomized algorithm of Hertli (2014) [2] for the Unique 3SAT problem. Using recently developed techniques (Hertli (2015) [3] and Scheder–Steinberger (2017) [7]), we can derive from this algorithm 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.

Keywords

Unique 3SAT problem
PPSZ algorithm
Hertli's algorithm

Cited by (0)