The work of Subhash Khot

Author(s): Arora, Sanjeev

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1m55w

Full metadata record

DC Field	Value	Language
dc.contributor.author	Arora, Sanjeev	-
dc.date.accessioned	2021-10-08T19:50:40Z	-
dc.date.available	2021-10-08T19:50:40Z	-
dc.date.issued	2014	en_US
dc.identifier.citation	Arora, Sanjeev. "The work of Subhash Khot." International Congress of Mathematicians 1 (2014): pp. 81-88.	en_US
dc.identifier.uri	http://www.icm2014.org/download/Proceedings_Volume_I.pdf	-
dc.identifier.uri	http://www.icm2014.org/en/vod/proceedings.html	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1m55w	-
dc.description.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.	en_US
dc.format.extent	81 - 88	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	International Congress of Mathematicians	en_US
dc.rights	Final published version. Article is made available in OAR by the publisher's permission or policy.	en_US
dc.title	The work of Subhash Khot	en_US
dc.type	Conference Article	en_US
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceeding	en_US

Files in This Item:

File	Description	Size	Format
WorkSubhash.pdf		18.02 MB	Adobe PDF	View/Download