Inapproximability of NP-complete Problems, Discrete Fourier Analysis, and Geometry

By Subhash Khot. 2011

48 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design

View Paper: https://www.semanticscholar.org/paper/3e952b431f1c3074d758b9ccdd66f7c2bc44ea48