MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Counting weighted solutions to 2SAT formulas

Magnus Wahlstroem
Lingkoeping University
Talk
AG 1, AG 3, AG 5, RG2, AG 2, AG 4, RG1, SWS  
AG Audience
English

Date, Time and Location

Thursday, 2 August 2007
10:30
30 Minutes
E1 4
024
Saarbrücken

Abstract

The problem of counting max-weight solutions to a 2SAT formula is

presented, an exact algorithm for it is shown, and methods of proving
an upper bound on its running time are given, with some focus on the
problem of giving upper bounds on the running time of exact,
exponential-time algorithms in general.

Contact

Benjamin Doerr
--email hidden
passcode not visible
logged in users only

Benjamin Doerr, 07/31/2007 14:33
Benjamin Doerr, 07/26/2007 15:11 -- Created document.