Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, April 29, 2014, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Isabelle Hurbain-Palatin
The PPSZ randomized algorithm (Paturi et al., 1998) is currently the fastest algorithm for k-SAT. It has been derandomized in 2005 by Rolf for Unique-k-SAT. In this master thesis presentation, I will explain a derandomization plan for the general case and explore the associated questions. The derandomization itself is still outside of our grasp, but we have gained valuable insight on the difficulties of such a task and on the PPSZ proof itself.
In particular, we will consider the following questions:
* Can PPSZ be run with a smaller set of permutations than the full set of the permutations over the variables of the formula?
* If we replace PPSZ with a version that sets non-frozen variables to 0 when it encounters them, can we prove the same success probability for the algorithm?
* Is there a way to set non-frozen variables to 0 when encountering them?
While these questions do not have a definite answer yet, I will present the work that has been done so far in the hope of answering them.
Automatic MiSe System Software Version 1.4803M | admin login