No photo of Subhash Khot

Subhash Khot

Silver Professor; Professor of Computer Science

    20002019

    Research output per year

    If you made any changes in Pure these will be visible here soon.

    Research Output

    Filter
    Conference article
    2005

    Hardness of Max 3SAT with no mixed clauses

    Guruswami, V. & Khot, S., Nov 16 2005, In : Proceedings of the Annual IEEE Conference on Computational Complexity. p. 154-162 9 p.

    Research output: Contribution to journalConference article

    2004

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

    Khot, S., Kindler, G., O'Donnell, R. & Mossel, E., Dec 1 2004, In : Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. p. 146-154 9 p.

    Research output: Contribution to journalConference article

    2003

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

    Khot, S. & Regev, O., Sep 1 2003, In : Proceedings of the Annual IEEE Conference on Computational Complexity. p. 379-386 8 p.

    Research output: Contribution to journalConference article

    2002

    Hardness results for approximate hypergraph coloring

    Khot, S., Jan 1 2002, In : Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 351-359 9 p.

    Research output: Contribution to journalConference article

    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 journalConference article