"Approximating Shortest Lattice Vectors is not Harder than Approximating ..."

Oded Goldreich et al. (1999)

> Home

Details and statistics

DOI: 10.1016/S0020-0190(99)00083-6

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/GoldreichMSS99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/GoldreichMSS99
Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert:
Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors. Inf. Process. Lett. 71(2): 55-61 (1999)

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.