The following pages link to Preyas Popat (Q1009337):
Displayed 7 items.
- NP-hardness of Euclidean sum-of-squares clustering (Q1009338) (← links)
- Fractal Structures in Adversarial Prediction (Q2989016) (← links)
- Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing (Q3190696) (← links)
- SDP Gaps for 2-to-1 and Other Label-Cover Variants (Q3587413) (← links)
- Approximate Lasserre Integrality Gap for Unique Games (Q3588416) (← links)
- 2 <sup> log1-ε <i>n</i> </sup> hardness for the closest vector problem with preprocessing (Q5415481) (← links)
- (Q5743433) (← links)