No photo of Subhash Khot

Subhash Khot

Silver Professor; Professor of Computer Science

    20002019
    If you made any changes in Pure, your changes will be visible here soon.

    Research Output 2000 2019

    Filter
    Article
    2018

    On monotonicity testing and boolean isoperimetric-type theorems

    Khot, S., Minzer, D. & Safra, M., Jan 1 2018, In : SIAM Journal on Computing. 47, 6, p. 2238-2276 39 p.

    Research output: Contribution to journalArticle

    Isoperimetric
    Monotonicity
    Testing
    Monotone Function
    Theorem
    2017

    Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(log n) ω(1) colors

    Khot, S. & Saket, R., 2017, In : SIAM Journal on Computing. 46, 1, p. 235-271 37 p.

    Research output: Contribution to journalArticle

    Probabilistically Checkable Proofs
    Uniform Hypergraph
    Coloring
    Hardness
    Colouring
    2015

    The unique games conjecture, integrality gap for cut problems and embeddability of negative-type metrics into ℓ1

    Khot, S. & Vishnoi, N. K., Feb 1 2015, In : Journal of the ACM. 62, 1, p. 8 1 p.

    Research output: Contribution to journalArticle

    Hardness
    2014

    Almost polynomial factor hardness for closest vector problem with preprocessing

    Khot, S., Popat, P. & Vishnoi, N. K., 2014, In : SIAM Journal on Computing. 43, 3, p. 1184-1205 22 p.

    Research output: Contribution to journalArticle

    Hardness
    Preprocessing
    Polynomials
    Polynomial

    A simple deterministic reduction for the gap minimum distance of code problem

    Austrin, P. & Khot, S., Oct 1 2014, In : IEEE Transactions on Information Theory. 60, 10, p. 6636-6645 10 p., 6868217.

    Research output: Contribution to journalArticle

    Sudan
    strike
    coding
    Hardness
    2013

    NP-Hardness of approximately solving linear equations over reals

    Khot, S. & Moshkovitz, D., 2013, In : SIAM Journal on Computing. 42, 3, p. 752-791 40 p.

    Research output: Contribution to journalArticle

    NP-hardness
    Linear equations
    Linear equation
    Assignment
    Hardness

    Sharp kernel clustering algorithms and their associated Grothendieck inequalities

    Khot, S. & Naor, A., May 2013, In : Random Structures and Algorithms. 42, 3, p. 269-300 32 p.

    Research output: Contribution to journalArticle

    Positive Semidefinite Matrix
    Clustering algorithms
    Clustering Algorithm
    Partition
    kernel
    2012

    Grothendieck-Type Inequalities in Combinatorial Optimization

    Khot, S. & Naor, A., Jul 2012, In : Communications on Pure and Applied Mathematics. 65, 7, p. 992-1035 44 p.

    Research output: Contribution to journalArticle

    Combinatorial optimization
    Combinatorial Optimization
    Computational complexity
    Computational Complexity
    2011

    Combinatorial theorems about embedding trees on the real line

    Chakrabarti, A. & Khot, S., Jun 2011, In : Journal of Graph Theory. 67, 2, p. 153-168 16 p.

    Research output: Contribution to journalArticle

    Real Line
    Metric
    Theorem
    Optimality
    Metric Embeddings

    Hardness of Approximating the Closest Vector Problem with Pre-Processing

    Alekhnovich, M., Khot, S. A., Kindler, G. & Vishnoi, N. K., Dec 2011, In : Computational Complexity. 20, 4, p. 741-753 13 p.

    Research output: Contribution to journalArticle

    Hardness
    Preprocessing
    Computational complexity
    Processing
    NP-complete problem

    On the hardness of learning intersections of two halfspaces

    Khot, S. & Saket, R., Jan 2011, In : Journal of Computer and System Sciences. 77, 1, p. 129-141 13 p.

    Research output: Contribution to journalArticle

    Half-space
    Hardness
    Intersection
    Classify
    Threshold Function
    2010

    Hardness of reconstructing multivariate polynomials over finite fields

    Gopalan, P., Khot, S. & Saket, R., 2010, In : SIAM Journal on Computing. 39, 6, p. 2598-2621 24 p.

    Research output: Contribution to journalArticle

    Multivariate Polynomials
    Hardness
    Galois field
    Polynomials
    Polynomial
    2009

    Approximate kernel clustering

    Khot, S. & Naor, A., Jan 2009, In : Mathematika. 55, 1-2, p. 129-165 37 p.

    Research output: Contribution to journalArticle

    Clustering
    kernel
    Positive Semidefinite Matrix
    Unit matrix
    Game

    Inapproximability of vertex cover and independent set in bounded degree graphs

    Austrin, P., Khot, S. & Safra, M., 2009, In : Theory of Computing Systems. 7, 1, p. 27-43

    Research output: Contribution to journalArticle

    On agnostic learning parities, monomials,and halfspaces

    Feldman, V., Gopalan, P., Khot, S. & Ponnuswami, A. K., 2009, In : SIAM Journal on Computing. 39, 2, p. 606-645

    Research output: Contribution to journalArticle

    On earthmover distance, Metric labeling, and 0-Extension

    Karloff, H., Khot, S., Mehta, A. & Rabani, Y., 2009, In : SIAM Journal on Computing. 39, 2, p. 371-387 17 p.

    Research output: Contribution to journalArticle

    Distance Metric
    Labeling
    Integrality
    Approximation algorithms
    Metric
    2008

    Inapproximability results for combinatorial auctions with submodular utility functions

    Khot, S., Lipton, R. J., Markakis, E. & Mehta, A., Sep 2008, In : Algorithmica (New York). 52, 1, p. 3-18 16 p.

    Research output: Contribution to journalArticle

    Combinatorial Auctions
    Submodular Function
    Inapproximability
    Approximation algorithms
    Welfare

    Linear equations modulo 2 and the L1 diameter of convex bodies

    Khot, S. & Naor, A., 2008, In : SIAM Journal on Computing. 38, 4, p. 1448-1463 16 p.

    Research output: Contribution to journalArticle

    Convex Body
    Linear equations
    Modulo
    Linear equation
    Randomized Algorithms

    Vertex cover might be hard to approximate to within 2 - ε

    Khot, S. & Regev, O., May 2008, In : Journal of Computer and System Sciences. 74, 3, p. 335-349 15 p.

    Research output: Contribution to journalArticle

    Vertex Cover
    Game
    Uniform Hypergraph
    Computing
    2007

    Improved lower bounds on the randomized complexity of graph properties

    Chakrabarti, A. & Khot, S., May 2007, In : Random Structures and Algorithms. 30, 3, p. 427-440 14 p.

    Research output: Contribution to journalArticle

    Graph Packing
    Lemma
    Monotone
    Lower bound
    Probabilistic Analysis

    Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?

    Khot, S., Kindler, G., Mossel, E. & O'Donnell, R., 2007, In : SIAM Journal on Computing. 37, 1, p. 319-357 39 p.

    Research output: Contribution to journalArticle

    Inapproximability
    Hardness
    Annual
    Approximation algorithms
    Game

    Proceedings Twenty-Second Annual IEEE Conference on Computational Complexity: Preface

    Downey, R., Khot, S., Klivans, A., Lutz, J., Miltersen, P. B., Pitassi, T., Shaltiel, R., Szegedy, M., Thierauf, T. & Yao, A. C. C., 2007, In : Unknown Journal. 4262741.

    Research output: Contribution to journalArticle

    Annual
    Computational complexity
    Computational Complexity
    2006

    Hardness of approximating the Shortest Vector Problem in high ℓp norms

    Khot, S., Mar 2006, In : Journal of Computer and System Sciences. 72, 2, p. 206-219 14 p.

    Research output: Contribution to journalArticle

    Approximation algorithms
    Hardness
    Polynomials
    Hardness of Approximation
    Norm

    Nonembeddability theorems via Fourier analysis

    Khot, S. & Naor, A., Apr 2006, In : Mathematische Annalen. 334, 4, p. 821-852 32 p.

    Research output: Contribution to journalArticle

    Fourier Analysis
    Edit Distance
    Group Action
    Hypercube
    Theorem

    Ruling out ptas for graph min-bisection, dense k-subgraph, and bipartite clique

    Khot, S., 2006, In : SIAM Journal on Computing. 36, 4, p. 1025-1071 47 p.

    Research output: Contribution to journalArticle

    Bisection
    Probabilistically Checkable Proofs
    Clique
    Subgraph
    Polynomials
    2005

    A new multilayered PCP and the hardness of hypergraph vertex cover

    Dinur, I., Guruswami, V., Khot, S. & Regev, O., 2005, In : SIAM Journal on Computing. 34, 5, p. 1129-1146 18 p.

    Research output: Contribution to journalArticle

    Probabilistically Checkable Proofs
    Vertex Cover
    Hypergraph
    Hardness
    Intersecting Family

    Guest column: Inapproximability results in long code based on PCPs

    Khot, S., Jun 2005, ACM SIGACT News, 36, 2.

    Research output: Contribution to specialist publicationArticle

    Hardness of approximating the shortest vector problem in lattices

    Khot, S., Sep 2005, In : Journal of the ACM. 52, 5, p. 789-808 20 p.

    Research output: Contribution to journalArticle

    Hardness
    Tensor Product
    Polynomial-time Algorithm
    Tensors
    Polynomials

    Query efficient PCPs with perfect completeness

    Håstad, J. & Khot, S., Sep 28 2005, In : Theory of Computing. 1, p. 119-148 30 p.

    Research output: Contribution to journalArticle

    Completeness
    Query
    Query Complexity
    Randomness
    Logarithmic
    2004

    Cell-probe lower bounds for the partial match problem

    Jayram, T. S., Khot, S., Kumar, R. & Rabani, Y., Nov 2004, In : Journal of Computer and System Sciences. 69, 3 SPEC. ISS., p. 435-447 13 p.

    Research output: Contribution to journalArticle

    Probe
    Lower bound
    Partial
    Cell
    Communication
    2003

    Fitting algebraic curves to noisy data

    Arora, S. & Khot, S., Sep 2003, In : Journal of Computer and System Sciences. 67, 2, p. 325-340 16 p.

    Research output: Contribution to journalArticle

    Algebraic curve
    Curve fitting
    Noisy Data
    Polynomials
    Polynomial-time Algorithm
    2002

    Evasiveness of subgraph containment and related properties

    Chakrabarti, A., Khot, S. & Shi, Y., 2002, In : SIAM Journal on Computing. 31, 3, p. 866-875 10 p.

    Research output: Contribution to journalArticle

    Decision trees
    Subgraph
    Graph in graph theory
    Graph Minors
    Planarity

    Parameterized complexity of finding subgraphs with hereditary properties

    Khot, S. & Raman, V., Oct 30 2002, In : Theoretical Computer Science. 289, 2, p. 997-1008 12 p.

    Research output: Contribution to journalArticle

    Hereditary Properties
    Parameterized Complexity
    Subgraph
    Hardness
    Ramsey number