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, February 28, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Jerri Nummenpalo

Finding One of Many Needles in a Haystack: Searching and Sampling SAT

Let F be a k-CNF formula over n variables with the promise that at least a c-fraction of all the 2^n assignments are satisfying for some given c = c(n). The trivial sampling algorithm needs in expectation 1/c many samples before finding a satisfying assignment for F. We consider it as a benchmark as we consider algorithms for both finding a satisfying assignment and sampling one uniformly at random among all satisfying assignments. This is joint work with Jean Cardinal, Jozsef Solymosi and Emo Welzl.

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