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

I. Dinur*, G. Kindler, S. Safra

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

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

Engineering & Materials Science