Approximating CVP to within almost-polynomial factors is NP-hard

I. Dinur, G. Kindler, R. Raz, S. Safra

Research output: Contribution to journal › Article › peer-review

98 Scopus citations

Fingerprint

Dive into the research topics of 'Approximating CVP to within almost-polynomial factors is NP-hard'. Together they form a unique fingerprint.

Mathematics

Keyphrases

Computer Science