- Hardness of Minimizing and Learning DNF Expressions Subhash Khot
- Fitting Algebraic Curves to Noisy Data Sanjeev Arora Subhash Khot y
- Approximate kernel clustering Subhash Khot
- Hardness Results for Approximate Hypergraph Coloring Subhash Khot
- Improved Lower Bounds on the Randomized Complexity of Graph Properties ?
- On Agnostic Learning of Parities, Monomials and Halfspaces Vitaly Feldman
- Inapproximability of Vertex Cover and Independent Set in Bounded Degree Per Austrin
- Vertex Cover Might be Hard to Approximate to within 2 -
- Evasiveness of Subgraph Containment and Related Properties ?
- B. Tech. Project Set Systems
- Hardness of Approximating the Shortest Vector Problem in High L p Norms
- Cellprobe lower bounds for the partial match problem T.S. Jayram # Subhash Khot + Ravi Kumar # Yuval Rabani #
- Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k 3 ")
- Linear equations modulo 2 and the L1 diameter of convex bodies Subhash Khot
- Sharp kernel clustering algorithms and their associated Grothendieck inequalities
- Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010
- On the Unique Games Conjecture Subhash Khot
- -Query Non-Adaptive PCP with Perfect Completeness Subhash Khot
- Hardness of Embedding Metric Spaces of Equal Size Subhash Khot and Rishi Saket
- On Earthmover Distance, Metric Labeling, and 0-Extension
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type
- Hardness of Reconstructing Multivariate Polynomials over Finite Fields
- Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
- On Hardness of Learning Intersection of Two Halfspaces Subhash Khot
- Query Efficient PCPs with Perfect Completeness Johan Hastad
- Hardness Results for Coloring 3Colorable 3Uniform Hypergraphs Subhash Khot y
- THEORY OF COMPUTING, Volume 0 (2008), pp. 135 http://theoryofcomputing.org
- On the Power of Unique 2Prover 1Round Games Subhash Khot
- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
- Integrality Gaps for Sparsest Cut and Minimum Linear Arrangement Problems
- Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph and Bipartite Clique
- Unique Games on Expanding Constraint Graphs are Easy [Extended Abstract]
- SDP Integrality Gaps with Local 1-Embeddability Subhash Khot
- Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
- Hardness of Approximating the Shortest Vector Problem in Lattices Subhash Khot
