Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Tuesday, January 19, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Dominik Scheder

Constraint Satisfaction - Speeding Up Deterministic Local Search By Defining a Graph on the Set of Colors

The currently fastest deterministic algorithm for k-SAT is based on deterministic local search, introduced by Dantsin et al. (2002). Basically the same algorithm can also be used to solve (d,k)-CSPs (constraint satisfaction problems), which are the same as CNF formulas, but with d instead of 2 'truth values'. In the talk, I will present this algorithm and show a surprisingly simple way to substantially improve its running time.

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

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