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, April 24, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Dominik Scheder

Unsatisfiable Linear k-CNF Formulas

Call a CNF formula linear if no two clauses have two or more variables in common. For example {{x,y}, {~x,z}, {~y,~z}} is linear, but {{u,v}, {~u,w}, {u,~w}} is not.

It is not obvious whether for any k there exist unsatisfiable linear k-CNFs. In this talk, I will show that they do exist, and derive some upper and lower bounds on the size of such formulas. The upper bound is obtained using a standard probabilistic argument, while we prove a lower bound using repeated application of the Lovasz Local Lemma.

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