Vijay Bhattiprolu
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Euiwoong Leeonce
- Madhur Tulsianionce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Separating the NP-Hardness of the Grothendieck problem from the Little-Grothendieck problem | ITCS 2022 | 2022-01-31 |
Proves NP-hardness of approximating the (bilinear) Grothendieck problem strictly beyond the PSD bound: shows no polytime algorithm achieves better than π/2 +… | ||
| Weak Decoupling, Polynomial Folds, and Approximate Optimization over the Sphere | Hierarchies, Extended Formulations and Matrix-Analytic Techniques (2017) | 2017-11-06 |
Claims a concrete tradeoff: powering a degree-D polynomial to degree Q and using SOS yields an n^{Q} time algorithm that achieves roughly an n / Q^{Q/2}… | ||
| nothing matches | ||