Lower bounds for 2-query LCCs over large alphabet

Published in Approximation, Randomization, and Combinatorial Optimization. (APPROX RANDOM 2017), 2017

Recommended citation: Arnab Bhattacharyya, Sivakanth Gopi, Avishay Tal, "Lower bounds for 2-query LCCs over large alphabet." Approximation, Randomization, and Combinatorial Optimization. (APPROX RANDOM 2017), 2017.
Download Paper