Computing unsatisfiable k-SAT instances with few occurrences per variable

Hoory, Shlomo; Szeider, Stefan

by Shlomo Hoory, Stefan Szeider

Reference:

Computing unsatisfiable k-SAT instances with few occurrences per variableShlomo Hoory, Stefan SzeiderTheoretical Computer Science, volume 337, number 1-3, pages 347-359, 2005.Note: Supplementary material is available at https://www.ac.tuwien.ac.at/files/pub/HoorySzeider05.tar.gz

Bibtex Entry:

@string{tcs="Theoretical Computer Science"}
@article {HoorySzeider05,
    author = {Hoory, Shlomo and Szeider, Stefan},
     title = {Computing unsatisfiable {k}-{SAT} instances with few
              occurrences per variable},
   journal = TCS,
    volume = {337},
      year = {2005},
    number = {1-3},
     pages = {347-359},
     note =  {Supplementary material is available at \url{https://www.ac.tuwien.ac.at/files/pub/HoorySzeider05.tar.gz}},
       url   = {https://www.ac.tuwien.ac.at/files/pub/HoorySzeider05.pdf},
}