The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (bibtex)
by
Reference:
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SATStefan SzeiderTheory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings (Oliver Kullmann, ed.), volume 5584 of Lecture Notes in Computer Science, pages 276-283, 2009, Springer Verlag.
Bibtex Entry:
@string{springer="Springer Verlag"}
@string{lncs="Lecture Notes in Computer Science"}
@inproceedings{Szeider09,
author    = {Stefan Szeider},
title     = {The Parameterized Complexity of k-Flip Local Search for
{SAT} and {MAX SAT}},
year      = {2009},
pages     = {276-283},
editor    = {Oliver Kullmann},
booktitle     = {Theory and Applications of Satisfiability Testing - SAT
2009, 12th International Conference, SAT 2009, Swansea,
UK, June 30 - July 3, 2009. Proceedings},
publisher = Springer,
series    = LNCS,
volume    = {5584},
}