Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Venkatesan Guruswami, Sai Sandeep. $d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors. Electronic Colloquium on Computational Complexity (ECCC), 26:116, 2019. [doi]