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: Thursday, October 30, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Heidi Gebauer

Unsatisfiable CNF-Formulas with Small Neighborhoods

By (k,s)-CNF we denote the set of CNF-formulas where every clause has exactly k distinct literals and each variable occurs in at most s clauses. Kratochvil, Savicky and Tuza showed by using the Lovasz Local Lemma that every (k, 2^k/ (ek))-CNF formula is satisfiable. From the other side Hoory and Szeider established unsatisfiable (k, log(k) * 2^k/ k)-CNF formulas, implying that the bound of Kratochvil et al. is tight up to a logarithmic factor. We can show that the bound of Kratochvil is even asymptotically tight by constructing an unsatisfiable(k, 4 * 2^k/ k)-CNF formula. This construction will be presented in the talk.

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