Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with PPSZ:
TR17-140 | 11th September 2017
Tong Qin, Osamu Watanabe

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.

more >>>

TR20-011 | 9th February 2020
Dominik Scheder, Navid Talebanfard

Super Strong ETH is true for strong PPSZ

We construct $k$-CNFs with $m$ variables on which the strong version of PPSZ $k$-SAT algorithm, which uses bounded width resolution, has success probability at most $2^{-(1 - (1 + \epsilon)2/k)m}$ for every $\epsilon > 0$. Previously such a bound was known only for the weak PPSZ algorithm which exhaustively searches ... more >>>

ISSN 1433-8092 | Imprint