Subhash Khot

Results: 9



#Item
1

SDP Integrality Gaps with Local `1-Embeddability Subhash Khot NYU Rishi Saket

Add to Reading List

Source URL: researcher.watson.ibm.com

Language: English - Date: 2011-11-26 16:44:09
    2

    SDP gaps for 2-to-1 and other Label-Cover variants Venkatesan Guruswami Computer Science Department Carnegie Mellon University Subhash Khot

    Add to Reading List

    Source URL: ttic.uchicago.edu

    Language: English - Date: 2011-10-12 09:48:16
      3

      On the Unique Games Conjecture Subhash Khot Courant Institute of Mathematical Sciences, NYU ∗

      Add to Reading List

      Source URL: www.cs.nyu.edu

      Language: English - Date: 2010-03-18 10:25:26
        4

        Celebrating 75 Years The Courant Institute of Mathematical Sciences at New York University Subhash Khot wins NSF’s Alan T.

        Add to Reading List

        Source URL: efdl.cims.nyu.edu

        Language: English - Date: 2014-01-01 15:09:58
          5Norwegian Academy of Science and Letters / Richard Courant / Courant Institute of Mathematical Sciences / Cathleen Synge Morawetz / Kurt O. Friedrichs / Peter Lax / Abel Prize / Hans Lewy / Courant / Academia / Mathematics / Science

          Celebrating 75 Years The Courant Institute of Mathematical Sciences at New York University Subhash Khot wins NSF’s Alan T.

          Add to Reading List

          Source URL: cims.nyu.edu

          Language: English - Date: 2011-03-25 14:40:04
          6Computational complexity theory / Quantum complexity theory / Communication / Communication complexity / Quantum information science / Multiparty communication complexity / Randomized algorithm / Nearest neighbor search / Pseudorandom generator / Theoretical computer science / Applied mathematics / Mathematics

          Cell-Probe Lower Bounds for the Partial Match Problem T.S. Jayram∗ Subhash Khot† Ravi Kumar∗

          Add to Reading List

          Source URL: www.cs.technion.ac.il

          Language: English - Date: 2007-04-01 08:28:26
          7Combinatorial optimization / NP-complete problems / Graph connectivity / Linear programming / Mathematical optimization / Vertex cover / Cut / Linear programming relaxation / Maximum cut / Theoretical computer science / Mathematics / Graph theory

          The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into `1 Subhash A. Khot Nisheeth K. Vishnoi

          Add to Reading List

          Source URL: www.cs.nyu.edu

          Language: English - Date: 2007-11-05 11:00:31
          8Conjectures / Combinatorial optimization / NP-complete problems / Mathematical optimization / Unique games conjecture / computational complexity theory / Maximum cut / Subhash Khot / P versus NP problem / Theoretical computer science / Mathematics / Applied mathematics

          Subhash Khot Typically, major math prizes are given for major results. But in this case, Subhash Khot is receiving the Nevanlinna Prize in large part for a conjecture – and even more surprisingly, one whose truth exper

          Add to Reading List

          Source URL: www.mathunion.org

          Language: English - Date: 2014-07-30 08:33:48
          9Symposium on Theory of Computing / Sanjeev Arora / Symposium on Foundations of Computer Science / Mathematical sciences / Journal of the ACM / Subhash Khot / Ran Raz / Gödel Prize / Computer science / Theoretical computer science / ACM SIGACT

          SANJEEV ARORA Curriculum Vitae, November[removed]Born in January 1968, in India. US Citizen

          Add to Reading List

          Source URL: www.cs.princeton.edu

          Language: English - Date: 2011-10-30 21:43:54
          UPDATE