DinurEtAl2003CVP
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
article2003
Catalog connections
Conjectures citing this source
Source record
Bibliographic fields
Inspect the parsed BibTeX fields
- author
- Irit Dinur and Guy Kindler and Ran Raz and Shmuel Safra
- doi
- 10.1007/s00493-003-0019-y
- journal
- Combinatorica
- number
- 2
- pages
- 205--243
- title
- Approximating {CVP} to Within Almost-Polynomial Factors is {NP}-Hard
- volume
- 23
- year
- 2003