Inapproximability of NP-complete problems, Discrete Fourier Analysis, and Geometry.

Subhash Khot
New York University

This talk will give an overview of some recent results on inapproximability of NP-complete problems and connections to discrete Fourier analysis and geometry.

Presentation (PowerPoint File)

Back to Quantitative and Computational Aspects of Metric Geometry