The following pages link to Sanjeev Arora (Q430827):
Displayed 50 items.
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- Approximation schemes for NP-hard geometric optimization problems: a survey (Q1403283) (← links)
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (Q1600093) (← links)
- Approximation schemes for degree-restricted MST and red-blue separation problems (Q1762989) (← links)
- Learning mixtures of separated nonspherical Gaussians (Q1774210) (← links)
- Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders (Q2345948) (← links)
- A randomized online algorithm for bandwidth utilization (Q2464418) (← links)
- Fréchet embeddings of negative type metrics (Q2471721) (← links)
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
- Improved low-degree testing and its applications (Q2494418) (← links)
- (Q2753720) (← links)
- Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) (Q2817637) (← links)
- Computing a Nonnegative Matrix Factorization---Provably (Q2817794) (← links)
- Approximation schemes for minimum latency problems (Q2819598) (← links)
- Local Versus Global Properties of Metric Spaces (Q2884582) (← links)
- (Q2913806) (← links)
- New approximation guarantee for chromatic number (Q2931386) (← links)
- Message-Passing Algorithms and Improved LP Decoding (Q2989683) (← links)
- (Q3002764) (← links)
- New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
- $O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time (Q3053148) (← links)
- New Tools for Graph Coloring (Q3088076) (← links)
- Semidefinite Programming and Approximation Algorithms: A Survey (Q3104593) (← links)
- Proof verification and the hardness of approximation problems (Q3158513) (← links)
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems (Q3158519) (← links)
- Testing Permanent Oracles – Revisited (Q3167410) (← links)
- Subexponential Algorithms for Unique Games and Related Problems (Q3177749) (← links)
- A Combinatorial, Primal-Dual Approach to Semidefinite Programs (Q3177769) (← links)
- (Q3549617) (← links)
- (Q3549678) (← links)
- Euclidean distortion and the sparsest cut (Q3581404) (← links)
- Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy (Q3581430) (← links)
- Local versus global properties of metric spaces (Q3581570) (← links)
- A Fast Random Sampling Algorithm for Sparsifying Matrices (Q3595390) (← links)
- Towards a Study of Low-Complexity Graphs (Q3638029) (← links)
- Probabilistic checking of proofs (Q3841041) (← links)
- (Q4230321) (← links)
- (Q4230322) (← links)
- (Q4234075) (← links)
- (Q4250161) (← links)
- (Q4252268) (← links)
- (Q4252725) (← links)
- (Q4395317) (← links)
- Approximation Schemes for Minimum Latency Problems (Q4429687) (← links)
- (Q4449174) (← links)
- (Q4461907) (← links)
- (Q4474203) (← links)