Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 29, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Isabelle Hurbain-Palatin

Towards the derandomization of the PPSZ algorithm for the multiple satisfying assignments case

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login