To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1m55w| Abstract: | Subhash Khot, the winner of the 2014 Nevanlinna Prize, has brought new clarity to the study of approximation algorithms for NP-hard problems, and opened new avenues of research. Several of these concern his Unique Games Conjecture, which has led to optimal inapproximability results that exactly characterize the approximability of the problem. |
| Publication Date: | 2014 |
| Citation: | Arora, Sanjeev. "The work of Subhash Khot." International Congress of Mathematicians 1 (2014): pp. 81-88. |
| Pages: | 81 - 88 |
| Type of Material: | Conference Article |
| Journal/Proceeding Title: | International Congress of Mathematicians |
| Version: | Final published version. Article is made available in OAR by the publisher's permission or policy. |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.