The following publications are possibly variants of this publication:
- Rainbow Coloring Hardness via Low Sensitivity PolymorphismsVenkatesan Guruswami, Sai Sandeep. approx 2019: [doi]
- Rainbow coloring hardness via low sensitivity polymorphismsVenkatesan Guruswami, Sai Sandeep. eccc, 26:94, 2019. [doi]
- Hardness of Rainbow Coloring HypergraphsVenkatesan Guruswami, Rishi Saket. fsttcs 2018: [doi]
- Hardness of Rainbow Coloring HypergraphsVenkatesan Guruswami, Rishi Saket. eccc, 24:147, 2017. [doi]
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long CodesVenkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma. SICOMP, 46(1):132-159, 2017. [doi]
- Super-polylogarithmic hypergraph coloring hardness via low-degree long codesVenkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma. eccc, 20:167, 2013. [doi]
- Super-polylogarithmic hypergraph coloring hardness via low-degree long codesVenkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma. stoc 2014: 614-623 [doi]
- PCPs via low-degree long code and hardness for constrained hypergraph coloringIrit Dinur, Venkatesan Guruswami. eccc, 20:122, 2013. [doi]
- PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph ColoringIrit Dinur, Venkatesan Guruswami. focs 2013: 340-349 [doi]