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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, November 16, 2006, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Philipp Zumstein

Satisfiability With Exponential Families

Fix some set S over the alphabet {0,1} of exponential size. The S-SAT problem asks whether a propositional formula F over some set of variables has a satisfying truth assignment in S. We will show that S-SAT is NP-complete for all context-free sets S. However, we also prove that S-SAT is not NP-hard in general (unless P = NP).

Joint work with Dominik Scheder.

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

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