Skip to content
cs-conference-ranking.org

d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors.

Venkatesan Guruswami, Sai Sandeep

VenueA*ICALP
Year2020
ProceedingsICALP
DBLP recordconf/icalp/GuruswamiS20 ↗

Browse the full ICALP paper archive.