Go to the corresponding LIPIcs Volume Portal 
Hecht, Yahli ; Minzer, Dor ; Safra, Muli
pdfformat: 

@InProceedings{hecht_et_al:LIPIcs.APPROX/RANDOM.2023.51, author = {Hecht, Yahli and Minzer, Dor and Safra, Muli}, title = {{NPHardness of Almost Coloring Almost 3Colorable Graphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {51:151:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772969}, ISSN = {18688969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18876}, URN = {urn:nbn:de:0030drops188761}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.51}, annote = {Keywords: PCP, Hardness of approximation} }
Keywords:  PCP, Hardness of approximation  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)  
Issue Date:  2023  
Date of publication:  04.09.2023 