## Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

# Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

 Mittagsseminar Talk Information

Date and Time: Thursday, October 18, 2012, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Robin Moser

## Towards a Generalization of the PPSZ Algorithm to Larger Domains, Part I

Since Timon Hertli's improved analysis (you recall his mittagsseminar talk of May 19, 2011), the PPSZ algorithm due to Paturi, Pudlák, Saks and Zane is the fastest known randomized algorithm for the k-SAT problem. In joint work with Hertli, Millius (Master's thesis), Scheder and Szedlák (Bachelors's thesis), we demonstrate that the PPSZ approach can be generalized to the case of (d,k)-ClSP which is the variant of k-SAT where the variables can take any number d of values, rather than just two. For many cases of d and k, we thereby obtain the fastest known (d,k)-ClSP algorithm.

In this talk, I will suggest a generalization of the PPSZ algorithm to (d,k)-ClSP and sketch an analysis in the simpler case where we assume the ClSP to have exactly one satisfying assignment. For this case, we obtain the fastest known algorithm for all d and k. This is largely based on the Bachelor's thesis by May Szedlák.

In the follow-up talk next week, Sebastian Millius will explain the result of his Master's thesis where he establishes that for many important cases of d and k, the aforementioned analysis can be generalized so as to hold without the uniqueness assumption, by means of similar proof techniques as provided by Hertli.

Previous talks by year:   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