Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, March 03, 2009, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Patrick Traxler
We discuss two questions.
1. Has k-SAT increasing exponential time complexity w.r.t. the number of solutions? A question of Calabro, Impagliazzo, Kabanets, Paturi '03 and '08.
2. Is exact counting of k-cnf solutions harder than approximate counting?
Automatic MiSe System Software Version 1.4803M | admin login