11 citations · 25 across the 14 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022★ 2 cited
Explicit Lower Bounds Against -Rounds of Sum-of-Squares
Max Hopkins, Ting-Chun Lin
We construct an explicit family of 3-XOR instances hard for -levels of the Sum-of-Squares (SoS) semi-definite programming hierarchy. Not only is this the first explicit const…
cs.CC2020
High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games
Mitali Bafna, Max Hopkins, Tali Kaufman +1
Higher order random walks (HD-walks) on high dimensional expanders (HDX) have seen an incredible amount of study and application since their introduction by Kaufman and Mass [KM16]…