The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT

Abstract

Full Citation:

Stefan Szeider. The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings (Oliver Kullmann), volume 5584 of Lecture Notes in Computer Science, pages 276-283, 2009, Springer Verlag.

Stefan Szeider

Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.