@InProceedings{li_et_al:LIPIcs.ISAAC.2021.33,
author = {Li, Shibo and Scheder, Dominik},
title = {{Impatient PPSZ - A Faster Algorithm for CSP}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {33:1--33:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.33},
URN = {urn:nbn:de:0030-drops-154662},
doi = {10.4230/LIPIcs.ISAAC.2021.33},
annote = {Keywords: Randomized algorithms, Constraint Satisfaction Problems, exponential-time algorithms}
}