22 citations · 23 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2023★ 1 cited
Relaxed Local Correctability from Local Testing
Vinayak M. Kumar, Geoffrey Mon
We construct the first asymptotically good relaxed locally correctable codes with polylogarithmic query complexity, bringing the upper bound polynomially close to the lower bound o…
cs.CC2023
Tight Correlation Bounds for Circuits Between AC0 and TC0
Vinayak M. Kumar
We initiate the study of generalized AC0 circuits comprised of negations and arbitrary unbounded fan-in gates that only need to be constant over inputs of Hamming weight , w…