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
107
Link opens in a new tab
Scopus
citations