MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s:::2:::) Time

Evgeny Dantsin, Alexander Wolpert. MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s:::2:::) Time. In Armin Biere, Carla P. Gomes, editors, Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings. Volume 4121 of Lecture Notes in Computer Science, pages 266-276, Springer, 2006. [doi]

Abstract

Abstract is missing.