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, March 24, 2011, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Ramamohan Paturi (UC San Diego)

Complexity of Evaluating Quantified k-CNFs

We relate the exponential complexities of k-SAT and the exponential complexity \Pi_2 3-SAT (evaluating formulas of the form \forall \vec{x} \exists \vec{y} \phi (\vec{x},\vec{y}) where $\phi$ is a 3-CNF in \vec{x} variables and \vec{y} variables) and show that if we assume the Strong Exponential-Time Hypothesis, then there is no algorithm for \Pi_2 3-SAT running in time 2^{cn} with c<1.

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