( en | de | ru )

 

Disambiguation of "Arora, Sanjeev"

Author of the publication

copydeleteadd this publication to your clipboard
Exploring complexity through reductions.

. Computational Complexity Theory, volume 10 of IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sanjeev Kumar

Sachin Arora

Sanjeev Sarpal

Deepika Arora

Deepak Arora

 

Other publications of authors with the same name

A randomized online algorithm for bandwidth utilization., and . SODA, page 535-539. ACM/SIAM, (2002)Improved Algorithms for Unique Games via Divide and Conquer., , , and . Electron. Colloquium Comput. Complex., (2010)Unlearning via Sparse Representations., , , , , , , and . CoRR, (2023)Semidefinite Programming and Approximation Algorithms: A Survey.. SWAT, volume 6139 of Lecture Notes in Computer Science, page 25. Springer, (2010)Unique games on expanding constraint graphs are easy: extended abstract., , , , , and . STOC, page 21-28. ACM, (2008)A combinatorial, primal-dual approach to semidefinite programs., and . STOC, page 227-236. ACM, (2007)A Compressed Sensing View of Unsupervised Text Embeddings, Bag-of-n-Grams, and LSTMs., , , and . ICLR (Poster), OpenReview.net, (2018)Exploring complexity through reductions.. Computational Complexity Theory, volume 10 of IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization., , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 244-253. PMLR, (2018)Towards a Study of Low-Complexity Graphs., , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 119-131. Springer, (2009)