"Approximating CVP to Within Almost-Polynomial Factors is NP-Hard."

Irit Dinur et al. (2003)

> Home

Details and statistics

DOI: 10.1007/S00493-003-0019-Y

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/DinurKRS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/DinurKRS03
Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra:
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. Comb. 23(2): 205-243 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.