Inapproximability of NP-complete problems, discrete fourier analysis, and geometry

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This article gives a survey of recent results that connect three areas in computer science and mathematics: (1) (Hardness of) computing approximate solutions to NP-complete problems. (2) Fourier analysis of boolean functions on boolean hypercube. (3) Certain problems in geometry, especially related to isoperimetry and embeddings between metric spaces.

Original languageEnglish (US)
Title of host publicationProceedings of the International Congress of Mathematicians 2010, ICM 2010
Pages2676-2697
Number of pages22
StatePublished - 2010
EventInternational Congress of Mathematicians 2010, ICM 2010 - Hyderabad, India
Duration: Aug 19 2010Aug 27 2010

Other

OtherInternational Congress of Mathematicians 2010, ICM 2010
CountryIndia
CityHyderabad
Period8/19/108/27/10

Fingerprint

Isoperimetry
Inapproximability
Fourier Analysis
Boolean Functions
Hypercube
Hardness
Metric space
Computer Science
Approximate Solution
NP-complete problem
Computing

Keywords

  • Approximation algorithms
  • Discrete Fourier analysis
  • Inapproximability
  • NP-completeness
  • Probabilistically checkable proofs

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Khot, S. (2010). Inapproximability of NP-complete problems, discrete fourier analysis, and geometry. In Proceedings of the International Congress of Mathematicians 2010, ICM 2010 (pp. 2676-2697)

Inapproximability of NP-complete problems, discrete fourier analysis, and geometry. / Khot, Subhash.

Proceedings of the International Congress of Mathematicians 2010, ICM 2010. 2010. p. 2676-2697.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khot, S 2010, Inapproximability of NP-complete problems, discrete fourier analysis, and geometry. in Proceedings of the International Congress of Mathematicians 2010, ICM 2010. pp. 2676-2697, International Congress of Mathematicians 2010, ICM 2010, Hyderabad, India, 8/19/10.
Khot S. Inapproximability of NP-complete problems, discrete fourier analysis, and geometry. In Proceedings of the International Congress of Mathematicians 2010, ICM 2010. 2010. p. 2676-2697
Khot, Subhash. / Inapproximability of NP-complete problems, discrete fourier analysis, and geometry. Proceedings of the International Congress of Mathematicians 2010, ICM 2010. 2010. pp. 2676-2697
@inproceedings{f3e3e0f1f31840b7a29016e82be74d82,
title = "Inapproximability of NP-complete problems, discrete fourier analysis, and geometry",
abstract = "This article gives a survey of recent results that connect three areas in computer science and mathematics: (1) (Hardness of) computing approximate solutions to NP-complete problems. (2) Fourier analysis of boolean functions on boolean hypercube. (3) Certain problems in geometry, especially related to isoperimetry and embeddings between metric spaces.",
keywords = "Approximation algorithms, Discrete Fourier analysis, Inapproximability, NP-completeness, Probabilistically checkable proofs",
author = "Subhash Khot",
year = "2010",
language = "English (US)",
isbn = "9814324302",
pages = "2676--2697",
booktitle = "Proceedings of the International Congress of Mathematicians 2010, ICM 2010",

}

TY - GEN

T1 - Inapproximability of NP-complete problems, discrete fourier analysis, and geometry

AU - Khot, Subhash

PY - 2010

Y1 - 2010

N2 - This article gives a survey of recent results that connect three areas in computer science and mathematics: (1) (Hardness of) computing approximate solutions to NP-complete problems. (2) Fourier analysis of boolean functions on boolean hypercube. (3) Certain problems in geometry, especially related to isoperimetry and embeddings between metric spaces.

AB - This article gives a survey of recent results that connect three areas in computer science and mathematics: (1) (Hardness of) computing approximate solutions to NP-complete problems. (2) Fourier analysis of boolean functions on boolean hypercube. (3) Certain problems in geometry, especially related to isoperimetry and embeddings between metric spaces.

KW - Approximation algorithms

KW - Discrete Fourier analysis

KW - Inapproximability

KW - NP-completeness

KW - Probabilistically checkable proofs

UR - http://www.scopus.com/inward/record.url?scp=84877918367&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877918367&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9814324302

SN - 9789814324304

SP - 2676

EP - 2697

BT - Proceedings of the International Congress of Mathematicians 2010, ICM 2010

ER -