Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Tuesday, November 15, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Andreas Razen

Counting satisfying 2SAT Assignments

2SAT, the satisfiability problem of CNF formulas whose clauses contain at most two literals, is known to be solvable in polynomial time. However, its associated counting problem #2SAT of determining the number of satisfying assignments an (<= 2)-CNF formula can have, is #P-complete.

We describe a method for weighting formulas that allows improved running times of the form O(2^cn) with c < 1 (n being the number of variables involved) suppressing polynomial factors, with the best current bound due to Fürer and Kasiviswanathan.

Additionally, we give a subclass of #2SAT instances that is solvable in linear time O(n).

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