Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some information on the structure of the formula that can be used in the second call. We use this idea to design new surprisingly simple algorithms for the MAX-SAT problem. Namely, we show that MAX-SAT for formulas with constant clause density can be solved in time c n, where c < 2 is a constant and n is the number of variables, and within polynomial space (the only known such algorithm by Dantsin and Wolpert uses exponential space). We also prove that MAX-2-SAT can be solved in time 2m/5.88, where m is the number of clauses (this improves the bound 2m/5,769 proved independently by Kneis et al. and by Scott and Sorkin).
Original language | English |
---|---|
Title of host publication | Computer Science - Theory and Applications - Second International Symposium on Computer Science in Russia, CSR 2007, Proceedings |
Pages | 194-204 |
Number of pages | 11 |
State | Published - 24 Dec 2007 |
Event | 2nd International Symposium on Computer Science in Russia, CSR 2007 - Ekaterinburg, Russian Federation Duration: 3 Sep 2007 → 7 Sep 2007 |
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 4649 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference | 2nd International Symposium on Computer Science in Russia, CSR 2007 |
---|---|
Country/Territory | Russian Federation |
City | Ekaterinburg |
Period | 3/09/07 → 7/09/07 |
ID: 49825111