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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, November 18, 2010, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Timon Hertli

Investigating and Improving the PPSZ Algorithm for SAT (master thesis)

A critical variable of a satisfiable CNF formula is a variable that has the same value in all satisfying assignments. Using a simple case distinction on the fraction of critical variables of a CNF formula, we improve the bound for 3-SAT from O(1.32216^n) by Rolf [2006] to O(1.32153^n). Using a different approach, Iwama et al. [2010+] very recently achieved a running time of O(1.32113^n). Our method nicely combines with theirs, yielding the currently fastest known algorithm with running time O(1.32065^n). We also improve the bound for 4-SAT from O(1.47390^n) [Iwama, Tamaki 2004] to O(1.46928^n), where O(1.46981^n) can be obtained using the methods of [Iwama, Tamaki 2004] and [Rolf 2006]. This is very close to the bound for unique 4-SAT for PPSZ, O(1.46899^n).


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

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


Automatic MiSe System Software Version 1.4803M   |   admin login