PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster

Dominik Scheder, John P. Steinberger. PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster. In Ryan O'Donnell, editor, 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia. Volume 79 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

@inproceedings{SchederS17,
  title = {PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster},
  author = {Dominik Scheder and John P. Steinberger},
  year = {2017},
  doi = {10.4230/LIPIcs.CCC.2017.9},
  url = {https://doi.org/10.4230/LIPIcs.CCC.2017.9},
  researchr = {https://researchr.org/publication/SchederS17},
  cites = {0},
  citedby = {0},
  booktitle = {32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia},
  editor = {Ryan O'Donnell},
  volume = {79},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-040-8},
}