The following pages link to Tselil Schramm (Q2149000):
Displayed 17 items.
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (Q2941510) (← links)
- (Q2969633) (← links)
- (Q2969662) (← links)
- Global and Local Information in Clustering Labeled Block Models (Q2976593) (← links)
- On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique (Q4554356) (← links)
- On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique (Q4575656) (← links)
- Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors (Q4978431) (← links)
- (Q4993305) (← links)
- (Q5090427) (← links)
- (Q5091758) (← links)
- HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS (Q5122161) (← links)
- (Q5158503) (← links)
- The threshold for SDP-refutation of random regular NAE-3SAT (Q5236327) (← links)
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors (Q5361828) (← links)
- Playing unique games on certified small-set expanders (Q6065280) (← links)
- Testing thresholds for high-dimensional sparse random geometric graphs (Q6083521) (← links)