Deterministic Algorithms for ::::k::::-SAT Based on Covering Codes and Local Search

Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning. Deterministic Algorithms for ::::k::::-SAT Based on Covering Codes and Local Search. In Ugo Montanari, José D. P. Rolim, Emo Welzl, editors, Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings. Volume 1853 of Lecture Notes in Computer Science, pages 236-247, Springer, 2000. [doi]

@inproceedings{DantsinGHS00,
  title = {Deterministic Algorithms for ::::k::::-SAT Based on Covering Codes and Local Search},
  author = {Evgeny Dantsin and Andreas Goerdt and Edward A. Hirsch and Uwe Schöning},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1853/18530236.htm},
  tags = {rule-based, search},
  researchr = {https://researchr.org/publication/DantsinGHS00},
  cites = {0},
  citedby = {0},
  pages = {236-247},
  booktitle = {Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  editor = {Ugo Montanari and José D. P. Rolim and Emo Welzl},
  volume = {1853},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67715-1},
}