### 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 language | English (US) |
---|---|

Title of host publication | Proceedings of the International Congress of Mathematicians 2010, ICM 2010 |

Pages | 2676-2697 |

Number of pages | 22 |

State | Published - 2010 |

Event | International Congress of Mathematicians 2010, ICM 2010 - Hyderabad, India Duration: Aug 19 2010 → Aug 27 2010 |

### Other

Other | International Congress of Mathematicians 2010, ICM 2010 |
---|---|

Country | India |

City | Hyderabad |

Period | 8/19/10 → 8/27/10 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Mathematics(all)

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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.

}

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 -