MAX-SAT for formulas with constant clause density can be solved faster than in O(2n) time

  • Authors:

  • Evgeny Dantsin;Alexander Wolpert

  • Affiliations:

  • Roosevelt University, Chicago, IL;Roosevelt University, Chicago, IL

  • Venue:
  • SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We give an exact deterministic algorithm for MAX-SAT. On input CNF formulas with constant clause density (the ratio of the number of clauses to the number of variables is a constant), this algorithm runs in ${\mathcal{O}}(c^n)$ time where cn is the number of variables. Worst-case upper bounds for MAX-SAT less than ${\mathcal{O}}(2^n)$ were previously known only for k-CNF formulas and for CNF formulas with small clause density.