BibTeX record journals/ipl/GoldreichMSS99

download as .bib file

@article{DBLP:journals/ipl/GoldreichMSS99,
  author       = {Oded Goldreich and
                  Daniele Micciancio and
                  Shmuel Safra and
                  Jean{-}Pierre Seifert},
  title        = {Approximating Shortest Lattice Vectors is not Harder than Approximating
                  Closest Lattice Vectors},
  journal      = {Inf. Process. Lett.},
  volume       = {71},
  number       = {2},
  pages        = {55--61},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0020-0190(99)00083-6},
  doi          = {10.1016/S0020-0190(99)00083-6},
  timestamp    = {Sat, 30 Sep 2023 10:16:57 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GoldreichMSS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.