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

Date and Time: Tuesday, May 18, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Johann A. Makowsky (Technion, Haifa and ETH Zürich)

Algorithms for SAT and #SAT for formulas of bounded tree width and clique width

We introduce formulas of bounded tree width and clique width and discuss the usefulness of these concepts in practical applications.

We show an algorithm which runs in time (4^k)n arithmetic operations for formulas of tree width k and length n. Previous algorithms had a constant which was at least double exponential in k.

Similar results hold for formulas of bounded clique width.

(Joint work with E. Fischer and E. Ravve)

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