![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 8 | Subhash Khot, Rishi Saket: Hardness of Minimizing and Learning DNF Expressions. FOCS 2008: 231-240 | |
| 7 | Subhash Khot, Rishi Saket: On hardness of learning intersection of two halfspaces. STOC 2008: 345-354 | |
| 6 | Subhash Khot, Rishi Saket: Hardness of Embedding Metric Spaces of Equal Size. APPROX-RANDOM 2007: 218-227 | |
| 5 | Parikshit Gopalan, Subhash Khot, Rishi Saket: Hardness of Reconstructing Multivariate Polynomials over Finite Fields. FOCS 2007: 349-359 | |
| 4 | Parikshit Gopalan, Subhash Khot, Rishi Saket: Hardness of Reconstructing Multivariate Polynomials over Finite Fields. Electronic Colloquium on Computational Complexity (ECCC) 14(073): (2007) | |
| 3 | Subhash Khot, Rishi Saket: A 3-Query Non-Adaptive PCP with Perfect Completeness. IEEE Conference on Computational Complexity 2006: 159-169 | |
| 2 | Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi: Integrality gaps for sparsest cut and minimum linear arrangement problems. STOC 2006: 537-546 |
Selection of 7 from 8 records - Rishi Saket has 5 coauthors
Copyright © 2009-12-04 by Michael Ley (ley@uni-trier.de)