Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, February 15, 2007, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Patrick Traxler
An input instance of UNIQUE-SAT is a cnf F with at most one satisfying assignment. F gets accepted iff it is satisfiable. We will address the following questions:
Is UNIQUE-SAT easier than SAT?
Is UNIQUE-d-CSP easier than CSP (Constraint Satisfaction)?
Automatic MiSe System Software Version 1.4803M | admin login