Hardness of approximation

5Citations
Citations of this article
57Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article accompanies the talk given by the author at the International Congress of Mathematicians, 2014. The article sketches some connections between approximability of NP-complete problems, analysis and geometry, and the role played by the Unique Games Conjecture in facilitating these connections. For a more extensive introduction to the topic, the reader is referred to survey articles [39, 40, 64].

Cite

CITATION STYLE

APA

Khot, S. (2014). Hardness of approximation. In Proceeding of the International Congress of Mathematicans, ICM 2014 (Vol. 1, pp. 711–728). KYUNG MOON SA Co. Ltd. https://doi.org/10.1007/978-3-662-04565-7_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free