"Approximating Shortest Lattice Vectors is Not Harder Than Approximating ..."

Oded Goldreich et al. (1999)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2023-09-30

- view
  - electronic edition @ weizmann.ac.il (open access)
- export record
  dblp key:
  - journals/eccc/ECCC-TR99-002
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR99-002
Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert:
Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors. Electron. Colloquium Comput. Complex. TR99 (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.