On the Complexity of Lattice Problems with Polynomial Approximation Factors

Oded Regev. On the Complexity of Lattice Problems with Polynomial Approximation Factors. In Phong Q. Nguyen, Brigitte Vallée, editors, The LLL Algorithm - Survey and Applications. Information Security and Cryptography, pages 475-496, Springer, 2010. [doi]

@incollection{Regev10-1,
  title = {On the Complexity of Lattice Problems with Polynomial Approximation Factors},
  author = {Oded Regev},
  year = {2010},
  doi = {10.1007/978-3-642-02295-1_15},
  url = {http://dx.doi.org/10.1007/978-3-642-02295-1_15},
  researchr = {https://researchr.org/publication/Regev10-1},
  cites = {0},
  citedby = {0},
  pages = {475-496},
  booktitle = {The LLL Algorithm - Survey and Applications},
  editor = {Phong Q. Nguyen and Brigitte Vallée},
  series = {Information Security and Cryptography},
  publisher = {Springer},
  isbn = {978-3-642-02294-4},
}