Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDSubhash Khot
Person information
- affiliation: New York University, NY, USA
- award: Nevanlinna Prize, 2014
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c82]Esty Kelman, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality. ITCS 2021: 26:1-26:17- [c81]Mark Braverman, Subhash Khot, Dor Minzer:
On Rich 2-to-1 Games. ITCS 2021: 27:1-27:20 - [c80]Amey Bhangale, Subhash Khot:
Optimal inapproximability of satisfiable k-LIN over non-abelian groups. STOC 2021: 1615-1628 - [i48]Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer:
An Invariance Principle for the Multi-slice, with Applications. CoRR abs/2110.10725 (2021) - [i47]Karthik C. S., Subhash Khot:
Almost Polynomial Factor Inapproximability for Parameterized k-Clique. CoRR abs/2112.03983 (2021) - 2020
- [c79]Amey Bhangale, Subhash Khot:
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut. Computational Complexity Conference 2020: 9:1-9:15 - [i46]Amey Bhangale, Subhash Khot:
Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups. CoRR abs/2009.02815 (2020) - [i45]Esty Kelman, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality. Electron. Colloquium Comput. Complex. 27: 9 (2020) - [i44]Amey Bhangale, Subhash Khot:
Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups. Electron. Colloquium Comput. Complex. 27: 130 (2020)
2010 – 2019
- 2019
- [c78]Prahladh Harsha
, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari:
Improved 3LIN Hardness via Linear Label Cover. APPROX-RANDOM 2019: 9:1-9:16 - [c77]Amey Bhangale, Subhash Khot:
UG-Hardness to NP-Hardness by Losing Half. Computational Complexity Conference 2019: 3:1-3:20 - [c76]Subhash Khot, Assaf Naor:
The Andoni-Krauthgamer-Razenshteyn characterization of sketchable norms fails for sketchable metrics. SODA 2019: 1814-1824 - [i43]Amey Bhangale, Subhash Khot:
UG-hardness to NP-hardness by Losing Half. Electron. Colloquium Comput. Complex. 26: 4 (2019) - [i42]Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari:
Improved 3LIN Hardness via Linear Label Cover. Electron. Colloquium Comput. Complex. 26: 93 (2019) - [i41]Mark Braverman, Subhash Khot, Dor Minzer:
On Rich $2$-to-$1$ Games. Electron. Colloquium Comput. Complex. 26: 141 (2019) - [i40]Amey Bhangale, Subhash Khot:
Simultaneous Max-Cut is harder to approximate than Max-Cut. Electron. Colloquium Comput. Complex. 26: 148 (2019) - 2018
- [j31]Subhash Khot, Dor Minzer, Muli Safra:
On Monotonicity Testing and Boolean Isoperimetric-type Theorems. SIAM J. Comput. 47(6): 2238-2276 (2018) - [c75]Subhash Khot, Dor Minzer, Muli Safra:
Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion. FOCS 2018: 592-601 - [c74]Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari:
Near-optimal approximation algorithm for simultaneous Max-Cut. SODA 2018: 1407-1425 - [c73]Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
Towards a proof of the 2-to-1 games conjecture? STOC 2018: 376-389 - [c72]Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
On non-optimally expanding sets in Grassmann graphs. STOC 2018: 940-951 - [i39]Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari:
Near-optimal approximation algorithm for simultaneous Max-Cut. CoRR abs/1801.04497 (2018) - [i38]Subhash Khot, Assaf Naor:
The Andoni-Krauthgamer-Razenshteyn characterization of sketchable norms fails for sketchable metrics. CoRR abs/1810.04321 (2018) - [i37]Subhash Khot, Dor Minzer, Muli Safra:
Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion. Electron. Colloquium Comput. Complex. 25: 6 (2018) - [i36]Subhash Khot, Dor Minzer, Dana Moshkovitz, Muli Safra:
Small Set Expansion in The Johnson Graph. Electron. Colloquium Comput. Complex. 25: 78 (2018) - 2017
- [j30]Subhash Khot, Rishi Saket:
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2(log n)Ømega(1) Colors. SIAM J. Comput. 46(1): 235-271 (2017) - [c71]Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari:
An Improved Dictatorship Test with Perfect Completeness. FSTTCS 2017: 15:1-15:23 - [c70]Subhash Khot, Dor Minzer, Muli Safra:
On independent sets, 2-to-2 games, and Grassmann graphs. STOC 2017: 576-589 - [i35]Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari:
An Improved Dictatorship Test with Perfect Completeness. CoRR abs/1702.04748 (2017) - [i34]Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari:
An Improved Dictatorship Test with Perfect Completeness. Electron. Colloquium Comput. Complex. 24: 30 (2017) - [i33]Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
On Non-Optimally Expanding Sets in Grassmann Graphs. Electron. Colloquium Comput. Complex. 24: 94 (2017) - 2016
- [c69]Subhash Khot, Igor Shinkar:
An ~O(n) Queries Adaptive Tester for Unateness. APPROX-RANDOM 2016: 37:1-37:7 - [c68]Subhash Khot, Rishi Saket:
Hardness of Bipartite Expansion. ESA 2016: 55:1-55:17 - [c67]Subhash Khot:
Hardness of Approximation. ICALP 2016: 3:1-3:1 - [c66]Subhash Khot, Igor Shinkar:
On Hardness of Approximating the Parameterized Clique Problem. ITCS 2016: 37-45 - [c65]Subhash Khot, Dana Moshkovitz:
Candidate hard unique game. STOC 2016: 63-76 - [i32]Subhash Khot, Igor Shinkar:
An $\widetilde{O}(n)$ Queries Adaptive Tester for Unateness. CoRR abs/1608.02451 (2016) - [i31]Subhash Khot, Rishi Saket:
Approximating CSPs using LP Relaxation. Electron. Colloquium Comput. Complex. 23: 116 (2016) - [i30]Subhash Khot, Dor Minzer, Muli Safra:
On Independent Sets, 2-to-2 Games and Grassmann Graphs. Electron. Colloquium Comput. Complex. 23: 124 (2016) - [i29]Subhash Khot, Igor Shinkar:
An Õ(n) Queries Adaptive Tester for Unateness. Electron. Colloquium Comput. Complex. 23: 126 (2016) - [i28]Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
Towards a Proof of the 2-to-1 Games Conjecture? Electron. Colloquium Comput. Complex. 23: 198 (2016) - 2015
- [j29]Subhash Khot, Nisheeth K. Vishnoi:
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ1. J. ACM 62(1): 8:1-8:39 (2015) - [c64]Subhash Khot, Dor Minzer, Muli Safra:
On Monotonicity Testing and Boolean Isoperimetric Type Theorems. FOCS 2015: 52-58 - [c63]Subhash Khot, Rishi Saket:
Approximating CSPs Using LP Relaxation. ICALP (1) 2015: 822-833 - [i27]Subhash Khot, Dor Minzer, Muli Safra:
On Monotonicity Testing and Boolean Isoperimetric type Theorems. Electron. Colloquium Comput. Complex. 22: 11 (2015) - [i26]Subhash Khot, Igor Shinkar:
On Hardness of Approximating the Parameterized Clique Problem. Electron. Colloquium Comput. Complex. 22: 13 (2015) - 2014
- [j28]Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi:
Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing. SIAM J. Comput. 43(3): 1184-1205 (2014) - [j27]Per Austrin, Subhash Khot:
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem. IEEE Trans. Inf. Theory 60(10): 6636-6645 (2014) - [c62]Subhash Khot, Rishi Saket:
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors. FOCS 2014: 206-215 - [c61]Subhash Khot, Madhur Tulsiani, Pratik Worah:
The Complexity of Somewhat Approximation Resistant Predicates. ICALP (1) 2014: 689-700 - [c60]Subhash Khot, Rishi Saket:
Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs. SODA 2014: 1607-1625 - [c59]Subhash Khot, Madhur Tulsiani, Pratik Worah:
A characterization of strong approximation resistance. STOC 2014: 634-643 - [i25]Subhash Khot, Rishi Saket:
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2log nΩ(1) Colors. Electron. Colloquium Comput. Complex. 21: 51 (2014) - [i24]Subhash Khot, Dana Moshkovitz:
Candidate Lasserre Integrality Gap For Unique Games. Electron. Colloquium Comput. Complex. 21: 142 (2014) - 2013
- [j26]Subhash Khot, Assaf Naor:
Sharp kernel clustering algorithms and their associated Grothendieck inequalities. Random Struct. Algorithms 42(3): 269-300 (2013) - [j25]Subhash Khot, Dana Moshkovitz:
NP-Hardness of Approximately Solving Linear Equations over Reals. SIAM J. Comput. 42(3): 752-791 (2013) - [j24]Subhash Khot, Muli Safra:
A Two-Prover One-Round Game with Strong Soundness. Theory Comput. 9: 863-887 (2013) - [c58]Subhash Khot:
On Approximation Resistance of Predicates (Invited Talk). FSTTCS 2013: 19-19 - [c57]Subhash Khot, Muli Safra, Madhur Tulsiani:
Towards an optimal query efficient PCP? ITCS 2013: 173-186 - [c56]Per Austrin, Subhash Khot:
A characterization of approximation resistance for even k-partite CSPs. ITCS 2013: 187-196 - [i23]Per Austrin, Subhash Khot:
A Characterization of Approximation Resistance for Even $k$-Partite CSPs. CoRR abs/1301.2731 (2013) - [i22]Subhash Khot, Nisheeth K. Vishnoi:
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into ℓ1. CoRR abs/1305.4581 (2013) - [i21]Subhash Khot, Madhur Tulsiani, Pratik Worah:
A Characterization of Strong Approximation Resistance. CoRR abs/1305.5500 (2013) - [i20]Subhash Khot, Rishi Saket:
Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs. CoRR abs/1308.3247 (2013) - [i19]Subhash Khot, Madhur Tulsiani, Pratik Worah:
A Characterization of Strong Approximation Resistance. Electron. Colloquium Comput. Complex. 20: 75 (2013) - [i18]Subhash Khot, Madhur Tulsiani, Pratik Worah:
A Characterization of Approximation Resistance. Electron. Colloquium Comput. Complex. 20: 146 (2013) - 2012
- [c55]Subhash Khot, Rishi Saket:
Hardness of Finding Independent Sets in Almost q-Colorable Graphs. FOCS 2012: 380-389 - [c54]Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi:
2log1-ε n hardness for the closest vector problem with preprocessing. STOC 2012: 277-288 - [i17]Subhash Khot, Muli Safra, Madhur Tulsiani:
Towards An Optimal Query Efficient PCP? Electron. Colloquium Comput. Complex. 19: 109 (2012) - [i16]Subhash Khot, Madhur Tulsiani, Pratik Worah:
The Complexity of Somewhat Approximation Resistant Predicates. Electron. Colloquium Comput. Complex. 19: 151 (2012) - 2011
- [j23]Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi:
Hardness of Approximating the Closest Vector Problem with Pre-Processing. Comput. Complex. 20(4): 741-753 (2011) - [j22]Subhash Khot, Rishi Saket:
On the hardness of learning intersections of two halfspaces. J. Comput. Syst. Sci. 77(1): 129-141 (2011) - [j21]Amit Chakrabarti, Subhash Khot:
Combinatorial theorems about embedding trees on the real line. J. Graph Theory 67(2): 153-168 (2011) - [j20]Per Austrin, Subhash Khot, Muli Safra:
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. Theory Comput. 7(1): 27-43 (2011) - [c53]Subhash Khot, Muli Safra:
A Two Prover One Round Game with Strong Soundness. FOCS 2011: 648-657 - [c52]Per Austrin, Subhash Khot:
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem. ICALP (1) 2011: 474-485 - [c51]Subhash Khot, Dana Moshkovitz:
NP-hardness of approximately solving linear equations over reals. STOC 2011: 413-420 - [i15]Subhash Khot, Assaf Naor:
Grothendieck-type inequalities in combinatorial optimization. CoRR abs/1108.2464 (2011) - [i14]Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi:
$2^{\log^{1-\eps} n}$ Hardness for Closest Vector Problem with Preprocessing. CoRR abs/1109.2176 (2011) - [i13]Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi:
2log1-έn Hardness for Closest Vector Problem with Preprocessing. Electron. Colloquium Comput. Complex. 18: 119 (2011) - 2010
- [j19]Parikshit Gopalan, Subhash Khot, Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. SIAM J. Comput. 39(6): 2598-2621 (2010) - [c50]Subhash Khot, Preyas Popat, Rishi Saket:
Approximate Lasserre Integrality Gap for Unique Games. APPROX-RANDOM 2010: 298-311 - [c49]Subhash Khot:
On the Unique Games Conjecture (Invited Survey). Computational Complexity Conference 2010: 99-121 - [c48]Irit Dinur, Subhash Khot, Will Perkins, Muli Safra:
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. FOCS 2010: 212-221 - [c47]Nikhil Bansal, Subhash Khot:
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. ICALP (1) 2010: 250-261 - [c46]Venkatesan Guruswami, Subhash Khot, Ryan O'Donnell, Preyas Popat, Madhur Tulsiani, Yi Wu:
SDP Gaps for 2-to-1 and Other Label-Cover Variants. ICALP (1) 2010: 617-628 - [c45]Subhash Khot, Assaf Naor:
Sharp Kernel Clustering Algorithms and Their Associated Grothendieck Inequalities. SODA 2010: 664-683 - [p1]Subhash Khot:
Inapproximability Results for Computational Problems on Lattices. The LLL Algorithm 2010: 453-473 - [i12]Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer:
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes). CoRR abs/1002.3864 (2010) - [i11]Per Austrin, Subhash Khot:
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem. CoRR abs/1010.1481 (2010) - [i10]Dana Moshkovitz, Subhash Khot:
Hardness of Approximately Solving Linear Equations Over Reals. Electron. Colloquium Comput. Complex. 17: 53 (2010) - [i9]Subhash Khot, Dana Moshkovitz:
NP-Hardness of Approximately Solving Linear Equations Over Reals. Electron. Colloquium Comput. Complex. 17: 112 (2010)
2000 – 2009
- 2009
- [j18]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani:
On Earthmover Distance, Metric Labeling, and 0-Extension. SIAM J. Comput. 39(2): 371-387 (2009) - [j17]Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami:
On Agnostic Learning of Parities, Monomials, and Halfspaces. SIAM J. Comput. 39(2): 606-645 (2009) - [j16]Subhash Khot, Ryan O'Donnell:
SDP Gaps and UGC-hardness for Max-Cut-Gain. Theory Comput. 5(1): 83-117 (2009) - [c44]Per Austrin, Subhash Khot, Muli Safra:
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. Computational Complexity Conference 2009: 74-80 - [c43]Nikhil Bansal, Subhash Khot:
Optimal Long Code Test with One Free Bit. FOCS 2009: 453-462 - [c42]Subhash Khot, Rishi Saket:
SDP Integrality Gaps with Local ell_1-Embeddability. FOCS 2009: 565-574 - [i8]Subhash Khot, Assaf Naor:
Sharp kernel clustering algorithms and their associated Grothendieck inequalities. CoRR abs/0906.4816 (2009) - 2008
- [j15]Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta:
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. Algorithmica 52(1): 3-18 (2008) - [j14]Subhash Khot, Oded Regev:
Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74(3): 335-349 (2008) - [j13]Subhash Khot, Assaf Naor:
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies. SIAM J. Comput. 38(4): 1448-1463 (2008) - [c41]Subhash Khot, Ashok Kumar Ponnuswami:
Minimizing Wide Range Regret with Time Selection Functions. COLT 2008: 81-86 - [c40]Subhash Khot, Rishi Saket:
Hardness of Minimizing and Learning DNF Expressions. FOCS 2008: 231-240 - [c39]Subhash Khot, Assaf Naor:
Approximate Kernel Clustering. FOCS 2008: 561-570 - [c38]Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi:
Unique games on expanding constraint graphs are easy: extended abstract. STOC 2008: 21-28 - [c37]Subhash Khot, Rishi Saket:
On hardness of learning intersection of two halfspaces. STOC 2008: 345-354 - [i7]Subhash Khot, Assaf Naor:
Approximate kernel clustering. CoRR abs/0807.4626 (2008) - 2007
- [j12]Amit Chakrabarti, Subhash Khot:
Improved lower bounds on the randomized complexity of graph properties. Random Struct. Algorithms 30(3): 427-440 (2007) - [j11]Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell:
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. SIAM J. Comput. 37(1): 319-357 (2007) - [c36]Subhash Khot, Ashok Kumar Ponnuswami:
Approximation Algorithms for the Max-Min Allocation Problem. APPROX-RANDOM 2007: 204-217 - [c35]Subhash Khot, Rishi Saket:
Hardness of Embedding Metric Spaces of Equal Size. APPROX-RANDOM 2007: 218-227 - [c34]Subhash Khot, Assaf Naor:
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies. FOCS 2007: 318-328 - [c33]Parikshit Gopalan, Subhash Khot, Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. FOCS 2007: 349-359 - [i6]Parikshit Gopalan, Subhash Khot, Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. Electron. Colloquium Comput. Complex. 14(073) (2007) - 2006
- [j10]Subhash Khot:
Hardness of approximating the Shortest Vector Problem in high lp norms. J. Comput. Syst. Sci. 72(2): 206-219 (2006) - [j9]Subhash Khot:
Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique. SIAM J. Comput. 36(4): 1025-1071 (2006) - [c32]Subhash Khot, Rishi Saket:
A 3-Query Non-Adaptive PCP with Perfect Completeness. Computational Complexity Conference 2006: 159-169 - [c31]Subhash Khot, Ryan O'Donnell:
SDP gaps and UGC-hardness for MAXCUTGAIN. FOCS 2006: 217-226 - [c30]Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami:
New Results for Learning Noisy Parities and Halfspaces. FOCS 2006: 563-574 - [c29]Subhash Khot, Ashok Kumar Ponnuswami:
Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion. ICALP (1) 2006: 226-237 - [c28]Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi:
Integrality gaps for sparsest cut and minimum linear arrangement problems. STOC 2006: 537-546 - [c27]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani:
On earthmover distance, metric labeling, and 0-extension. STOC 2006: 547-556 - [i5]Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami:
New Results for Learning Noisy Parities and Halfspaces. Electron. Colloquium Comput. Complex. 13(059) (2006) - 2005
- [j8]Subhash Khot:
Hardness of approximating the shortest vector problem in lattices. J. ACM 52(5): 789-808 (2005) - [j7]Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev:
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. SIAM J. Comput. 34(5): 1129-1146 (2005) - [j6]Subhash Khot:
Guest column: inapproximability results via Long Code based PCPs. SIGACT News 36(2): 25-42 (2005) - [j5]Johan Håstad, Subhash Khot:
Query Efficient PCPs with Perfect Completeness. Theory Comput. 1(1): 119-148 (2005) - [c26]Venkatesan Guruswami, Subhash Khot:
Hardness of Max 3SAT with No Mixed Clauses. Computational Complexity Conference 2005: 154-162 - [c25]Subhash Khot:
On the Unique Games Conjecture. FOCS 2005: 3 - [c24]Subhash Khot, Nisheeth K. Vishnoi:
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1. FOCS 2005: 53-62 - [c23]Subhash Khot, Assaf Naor:
Nonembeddability theorems via Fourier analysis. FOCS 2005: 101-112 - [c22]Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi:
Hardness of Approximating the Closest Vector Problem with Pre-Processing. FOCS 2005: 216-225 - [c21]Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta:
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. WINE 2005: 92-101 - [i4]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani:
On earthmover distance, metric labeling, and 0-extension. Electron. Colloquium Comput. Complex.(064) (2005) - [i3]Guy Kindler, Ryan O'Donnell, Subhash Khot, Elchanan Mossel:
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? Electron. Colloquium Comput. Complex.(101) (2005) - 2004
- [j4]T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani:
Cell-probe lower bounds for the partial match problem. J. Comput. Syst. Sci. 69(3): 435-447 (2004) - [c20]Subhash Khot:
Hardness of Approximating the Shortest Vector Problem in Lattices. FOCS 2004: 126-135 - [c19]Subhash Khot:
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. FOCS 2004: 136-145 - [c18]Subhash Khot, Guy Kindler,