research
∙
10/06/2022
Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses
We study random constraint satisfaction problems (CSPs) in the unsatisfi...
share
research
∙
03/05/2022
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition
We give a spectral algorithm for decomposing overcomplete order-4 tensor...
research
∙
08/13/2021
Limitations of Local Quantum Algorithms on Random Max-k-XOR and Beyond
Motivated by a question of Farhi et al. [arXiv:1910.08187, 2019], we stu...
research
∙
08/13/2020
Cut Sparsification of the Clique Beyond the Ramanujan Bound
We prove that a random d-regular graph, with high probability, is a cut ...
research
∙
12/08/2015