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, June 24, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Timon Hertli

Randomized k-SAT counting

We present a zero-error randomized algorithm for #k-SAT by Impagliazzo, Matthews, and Paturi [1]. The algorithm is a corollary to a more general algorithm for bounded depth circuits based on Håstad's switching lemma.

Noteworthy is that this algorithm is much faster (for large k) than the best known determinstic algorithm. The randomized algorithm runs in 2(1-1/(30k))n, whereas the deterministic algorithm takes time approximately 2(1-1/(2^k))n (n denotes the number of variables).

[1] Russell Impagliazzo, William Matthews, and Ramamohan Paturi: A Satisfiability Algorithm for AC0 (SODA, 2012)

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