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, May 17, 2011, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Robin Moser

Introduction to the PPSZ Algorithm

Only few months ago, Timon Hertli has achieved a breakthrough in the theory of satisfiability testing by considerably improving and simplifying the analysis of the well-known k-SAT algorithm PPSZ due to Paturi, Pudlk, Saks and Zane. The improvement leads to a dramatic speedup of the fastest currently known algorithm for 3-SAT. On Thursday, Timon will present his result in the Mittagsseminar.

As outlining the improvement will require at least 30 minutes of your esteemed attention, I will make use of the Tuesday slot to prepare the audience by introducing the PPSZ algorithm and by reviewing the previously known parts of the analysis and some of the history of k-SAT solving in general.

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