search
Get Started
search
Subhash Khot - Computer Scientist
zoom_in Click to enlarge

Subhash Khot

Computer Scientist Indian Nyu Complexity Theory Unique Games Hardness Of Approximation

description Subhash Khot Overview

Subhash Khot is a professor of computer science at New York University's Courant Institute of Mathematical Sciences. In 2002 he proposed the Unique Games Conjecture, a hypothesis about the hardness of approximating certain constraint satisfaction problems that has become one of the most influential open questions in computational complexity theory. The conjecture has yielded strong inapproximability results for a wide range of optimization problems. He received the Rolf Nevanlinna Prize in 2014 for this body of work.

insights Ranking position

Subhash Khot ranks #85 of 185 in the Computer Scientist ranking, behind Rajeev Motwani, ahead of Russell Impagliazzo.

help Subhash Khot FAQ

What is the Unique Games Conjecture proposed by Subhash Khot?

The Unique Games Conjecture (UGC), proposed by Khot in 2002, asserts that a specific type of constraint satisfaction problem is NP-hard to approximate beyond a certain threshold. If true, the UGC would settle the approximability of a wide range of NP-hard optimization problems and prove that semidefinite programming gives optimal approximation algorithms for them.

What prize did Subhash Khot win for his work?

Khot was awarded the Rolf Nevanlinna Prize in 2014 for his work on the Unique Games Conjecture and its far-reaching consequences in hardness of approximation. The Nevanlinna Prize is awarded every four years by the International Mathematical Union.

Where does Subhash Khot work?

Khot is a professor of computer science at New York University's Courant Institute of Mathematical Sciences. He has been at NYU since completing his PhD at Princeton under the supervision of Sanjeev Arora.

Has the Unique Games Conjecture been proven or disproven?

As of the mid-2020s, the UGC remains one of the most important open problems in theoretical computer science. A major partial result came in 2018 when Bubeck showed that a plausible variant of the conjecture may be false, but the core UGC itself is still unresolved.

Reviews & Comments

Write a Review

rate_review

Be the first to review

Share your thoughts with the community and help others make better decisions.

Save to your list

Save your favorites and follow how their scores change over time.

Save favorites
Get updates
Compare scores

Already have an account? Sign in

Compare Items

See how they stack up against each other

Comparing
VS
Select 1 more item to compare