Vijay Bhattiprolu

Separating a voronoi diagram via local search

Given a set

Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere

\mathsf{P}

Extending Parikh’s Theorem to Weighted and Probabilistic Context-Free Grammars

of

Approximate Hypergraph Coloring under Low-discrepancy and Related Promises

n

Certifying Random Polynomials over the Unit Sphere via Sum of Squares Hierarchy.

points in

Separating a Voronoi Diagram.

\mathbb{R}^d

Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere.

, we show how to insert a set

A PTAS for

\mathsf{X}

\ell_p

of

-Low Rank Approximation

O( n^{1-1/d} )