10 citations · 63 across the 24 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CC2020★ 4 cited
Explicit SoS lower bounds from high-dimensional expanders
Irit Dinur, Yuval Filmus, Prahladh Harsha +1
We construct an explicit family of 3XOR instances which is hard for levels of the Sum-of-Squares hierarchy. In contrast to earlier constructions, which involve a…
cs.CC2020
Locally testable codes via high-dimensional expanders
Yotam Dikstein, Irit Dinur, Prahladh Harsha +1
Locally testable codes (LTC) are error-correcting codes that have a local tester which can distinguish valid codewords from words that are "far" from all codewords by probing a giv…