@InProceedings{hecht_et_al:LIPIcs.APPROX/RANDOM.2023.51,
author = {Hecht, Yahli and Minzer, Dor and Safra, Muli},
title = {{NP-Hardness of Almost Coloring Almost 3-Colorable Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {51:1--51:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.51},
URN = {urn:nbn:de:0030-drops-188761},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.51},
annote = {Keywords: PCP, Hardness of approximation}
}