101 citations · 161 across the 15 of their papers we have counts for
1 paper · 1 filter
Venkatesan Guruswami, Johan Hastad, Prahladh Harsha +2
We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the 'short code' of Barak et. al. [FOCS 2012]) and the techniques pro…