Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive 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
Journal Articles
- 2022
[j32]Amey Bhangale, Subhash Khot:
UG-hardness to NP-hardness by Losing Half. Theory Comput. 18: 1-28 (2022)- 2018
- [j31]Subhash Khot, Dor Minzer, Muli Safra
:
On Monotonicity Testing and Boolean Isoperimetric-type Theorems. SIAM J. Comput. 47(6): 2238-2276 (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) - 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) - 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) - 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) - 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) - 2010
- [j19]Parikshit Gopalan, Subhash Khot, Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. SIAM J. Comput. 39(6): 2598-2621 (2010) - 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) - 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) - 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) - 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) - 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) - 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) - 2003
- [j3]Sanjeev Arora, Subhash Khot:
Fitting algebraic curves to noisy data. J. Comput. Syst. Sci. 67(2): 325-340 (2003) - 2002
- [j2]Subhash Khot, Venkatesh Raman:
Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289(2): 997-1008 (2002) - 2001
- [j1]Amit Chakrabarti, Subhash Khot, Yaoyun Shi:
Evasiveness of Subgraph Containment and Related Properties. SIAM J. Comput. 31(3): 866-875 (2001)
Conference and Workshop Papers
- 2023
- [c89]Mark Braverman, Subhash Khot, Dor Minzer:
Parallel Repetition for the GHZ Game: Exponential Decay. FOCS 2023: 1337-1341 - [c88]Mark Braverman, Subhash Khot, Guy Kindler, Dor Minzer:
Improved Monotonicity Testers via Hypercube Embeddings. ITCS 2023: 25:1-25:24 - [c87]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: II. STOC 2023: 632-642 - [c86]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: III. STOC 2023: 643-655 - 2022
- [c85]Karthik C. S., Subhash Khot:
Almost Polynomial Factor Inapproximability for Parameterized k-Clique. CCC 2022: 6:1-6:21 - [c84]Amey Bhangale, Subhash Khot, Dor Minzer:
On approximability of satisfiable k-CSPs: I. STOC 2022: 976-988 - 2021
- [c83]Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer:
An Invariance Principle for the Multi-slice, with Applications. FOCS 2021: 228-236 - [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 - 2020
- [c79]Amey Bhangale, Subhash Khot:
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut. CCC 2020: 9:1-9:15 - 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. CCC 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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). CCC 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 - 2009
- [c44]Per Austrin, Subhash Khot, Muli Safra:
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. CCC 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 - 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 - 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 - 2006
- [c32]Subhash Khot, Rishi Saket:
A 3-Query Non-Adaptive PCP with Perfect Completeness. CCC 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 - 2005
- [c26]Venkatesan Guruswami, Subhash Khot:
Hardness of Max 3SAT with No Mixed Clauses. CCC 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 - 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, Elchanan Mossel, Ryan O'Donnell:
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? FOCS 2004: 146-154 - [c17]Jonas Holmerin, Subhash Khot:
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. STOC 2004: 11-20 - 2003
- [c16]Amit Chakrabarti, Subhash Khot, Xiaodong Sun:
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. CCC 2003: 107-117 - [c15]Jonas Holmerin, Subhash Khot:
A Strong Inapproximability Gap for a Generalization of Minimum Bisection. CCC 2003: 371-378 - [c14]Subhash Khot, Oded Regev:
Vertex Cover Might be Hard to Approximate to within 2-\varepsilon. CCC 2003: 379- - [c13]Subhash Khot:
Hardness of Approximating the Shortest Vector Problem in High Lp Norms. FOCS 2003: 290-297 - [c12]Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev:
A new multilayered PCP and the hardness of hypergraph vertex cover. STOC 2003: 595-601 - [c11]T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani:
Cell-probe lower bounds for the partial match problem. STOC 2003: 667-672 - 2002
- [c10]Subhash Khot:
On the Power of Unique 2-Prover 1-Round Games. CCC 2002: 25 - [c9]Subhash Khot:
Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs. FOCS 2002: 23-32 - [c8]Sanjeev Arora, Subhash Khot:
Fitting algebraic curves to noisy data. STOC 2002: 162-169 - [c7]Subhash Khot:
Hardness results for approximate hypergraph coloring. STOC 2002: 351-359 - [c6]Subhash Khot:
On the power of unique 2-prover 1-round games. STOC 2002: 767-775 - 2001
- [c5]Subhash Khot:
Improved Inaproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring. FOCS 2001: 600-609 - [c4]Johan Håstad, Subhash Khot:
Query Efficient PCPs with Perfect Completeness. FOCS 2001: 610-619 - [c3]Amit Chakrabarti, Subhash Khot:
Improved Lower Bounds on the Randomized Complexity of Graph Properties. ICALP 2001: 285-296 - [c2]Amit Chakrabarti, Subhash Khot, Yaoyun Shi:
Evasiveness of Subgraph Containment and Related Properties. STACS 2001: 110-120 - 2000
- [c1]Subhash Khot, Venkatesh Raman:
Parameterized Complexity of Finding Subgraphs with Hereditary Properties. COCOON 2000: 137-147
Parts in Books or Collections
- 2010
- [p1]Subhash Khot:
Inapproximability Results for Computational Problems on Lattices. The LLL Algorithm 2010: 453-473
Informal and Other Publications
- 2023
- [i60]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: IV. CoRR abs/2307.16248 (2023) - [i59]Amey Bhangale, Subhash Khot, Dor Minzer:
Effective Bounds for Restricted 3-Arithmetic Progressions in Fpn. CoRR abs/2308.06600 (2023) - [i58]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. CoRR abs/2312.04783 (2023) - [i57]Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition of k-Player Projection Games. Electron. Colloquium Comput. Complex. TR23 (2023) - [i56]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: III. Electron. Colloquium Comput. Complex. TR23 (2023) - [i55]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: II. Electron. Colloquium Comput. Complex. TR23 (2023) - [i54]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: IV. Electron. Colloquium Comput. Complex. TR23 (2023) - [i53]Amey Bhangale, Subhash Khot, Dor Minzer:
Effective Bounds for Restricted $3$-Arithmetic Progressions in $\mathbb{F}_p^n$. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i52]Mark Braverman, Subhash Khot, Guy Kindler, Dor Minzer:
Improved Monotonicity Testers via Hypercube Embeddings. CoRR abs/2211.09229 (2022) - [i51]Mark Braverman, Subhash Khot, Dor Minzer:
Parallel Repetition for the GHZ Game: Exponential Decay. CoRR abs/2211.13741 (2022) - [i50]Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: I. Electron. Colloquium Comput. Complex. TR22 (2022) - [i49]Mark Braverman, Subhash Khot, Dor Minzer:
Parallel Repetition for the GHZ Game: Exponential Decay. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [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
- [i46]Amey Bhangale, Subhash Khot:
Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups. CoRR abs/2009.02815 (2020) - [i45]Amey Bhangale, Subhash Khot:
Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups. Electron. Colloquium Comput. Complex. TR20 (2020) - [i44]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. TR20 (2020) - 2019
- [i43]Amey Bhangale, Subhash Khot:
UG-hardness to NP-hardness by Losing Half. Electron. Colloquium Comput. Complex. TR19 (2019) - [i42]Amey Bhangale, Subhash Khot:
Simultaneous Max-Cut is harder to approximate than Max-Cut. Electron. Colloquium Comput. Complex. TR19 (2019) - [i41]Mark Braverman, Subhash Khot, Dor Minzer:
On Rich $2$-to-$1$ Games. Electron. Colloquium Comput. Complex. TR19 (2019) - [i40]Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari:
Improved 3LIN Hardness via Linear Label Cover. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [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, Dana Moshkovitz, Muli Safra:
Small Set Expansion in The Johnson Graph. Electron. Colloquium Comput. Complex. TR18 (2018) - [i36]Subhash Khot, Dor Minzer, Muli Safra:
Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [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. TR17 (2017) - [i33]Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
On Non-Optimally Expanding Sets in Grassmann Graphs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i32]Subhash Khot, Igor Shinkar:
An $\widetilde{O}(n)$ Queries Adaptive Tester for Unateness. CoRR abs/1608.02451 (2016) - [i31]Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra:
Towards a Proof of the 2-to-1 Games Conjecture? Electron. Colloquium Comput. Complex. TR16 (2016) - [i30]Subhash Khot, Dor Minzer, Muli Safra:
On Independent Sets, 2-to-2 Games and Grassmann Graphs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i29]Subhash Khot, Rishi Saket:
Approximating CSPs using LP Relaxation. Electron. Colloquium Comput. Complex. TR16 (2016) - [i28]Subhash Khot, Igor Shinkar:
An Õ(n) Queries Adaptive Tester for Unateness. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i27]Subhash Khot, Dor Minzer, Muli Safra:
On Monotonicity Testing and Boolean Isoperimetric type Theorems. Electron. Colloquium Comput. Complex. TR15 (2015) - [i26]Subhash Khot, Igor Shinkar:
On Hardness of Approximating the Parameterized Clique Problem. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i25]Subhash Khot, Dana Moshkovitz:
Candidate Lasserre Integrality Gap For Unique Games. Electron. Colloquium Comput. Complex. TR14 (2014) - [i24]Subhash Khot, Rishi Saket:
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2log nΩ(1) Colors. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [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. TR13 (2013) - [i18]Subhash Khot, Madhur Tulsiani, Pratik Worah:
A Characterization of Approximation Resistance. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i17]Subhash Khot, Muli Safra, Madhur Tulsiani:
Towards An Optimal Query Efficient PCP? Electron. Colloquium Comput. Complex. TR12 (2012) - [i16]Subhash Khot, Madhur Tulsiani, Pratik Worah:
The Complexity of Somewhat Approximation Resistant Predicates. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [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. TR11 (2011) - 2010
- [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]Subhash Khot, Dana Moshkovitz:
NP-Hardness of Approximately Solving Linear Equations Over Reals. Electron. Colloquium Comput. Complex. TR10 (2010) - [i9]Dana Moshkovitz, Subhash Khot:
Hardness of Approximately Solving Linear Equations Over Reals. Electron. Colloquium Comput. Complex. TR10 (2010) - 2009
- [i8]Subhash Khot, Assaf Naor:
Sharp kernel clustering algorithms and their associated Grothendieck inequalities. CoRR abs/0906.4816 (2009) - 2008
- [i7]Subhash Khot, Assaf Naor:
Approximate kernel clustering. CoRR abs/0807.4626 (2008) - 2007
- [i6]Parikshit Gopalan, Subhash Khot, Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [i5]Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami:
New Results for Learning Noisy Parities and Halfspaces. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [i4]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani:
On earthmover distance, metric labeling, and 0-extension. Electron. Colloquium Comput. Complex. TR05 (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. TR05 (2005) - 2003
- [i2]Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev:
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. CoRR cs.CC/0304026 (2003) - 2002
- [i1]Irit Dinur, Venkatesan Guruswami, Subhash Khot:
Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon). Electron. Colloquium Comput. Complex. TR02 (2002)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-01-11 20:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
