@InProceedings{scheder_et_al:LIPIcs.CCC.2017.9,
  author =	{Scheder, Dominik and Steinberger, John P.},
  title =	{{PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster}},
  booktitle =	{32nd Computational Complexity Conference (CCC 2017)},
  pages =	{9:1--9:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-040-8},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{79},
  editor =	{O'Donnell, Ryan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.9},
  URN =		{urn:nbn:de:0030-drops-75355},
  doi =		{10.4230/LIPIcs.CCC.2017.9},
  annote =	{Keywords: Boolean satisfiability, exponential algorithms, randomized algorithms}
}