Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, September 25, 2008, 12:15 pm

**Duration**: This information is not available in the database

**Location**: CAB G51

**Speaker**: Dominik Scheder

Call a CNF formula *almost disjoint* if any two distinct clauses have at most one variable in common. What is the maximum integer m such that every almost disjoint k-CNF formula with m clauses is satisfiable? Denote this number by m(k). We prove pretty tight upper and lower bounds on m(k).

The upper bound uses a randomized construction of an unsatisfiable almost disjoint formula. We do not have any *explicit* construction that comes even close to the lower bound. However, we have certain arguments why a barehanded approach to constructing such formulas should always be difficult.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 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