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

I. Dinur, G. Kindler, S. Safra

Research output: Contribution to journalConference articlepeer-review

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