Preyas Popat
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On the hardness of pricing loss-leaders | 2019-05-10 | Paper |
| Fractal Structures in Adversarial Prediction Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
| Almost polynomial factor hardness for closest vector problem with preprocessing SIAM Journal on Computing | 2014-09-18 | Paper |
| \(2^{\log^{1-\varepsilon} n}\) hardness for the closest vector problem with preprocessing Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
| Approximate Lasserre integrality gap for unique games Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
| SDP gaps for 2-to-1 and other Label-Cover variants Automata, Languages and Programming | 2010-09-07 | Paper |
| NP-hardness of Euclidean sum-of-squares clustering Machine Learning | 2009-03-31 | Paper |
Research outcomes over time
This page was built for person: Preyas Popat
