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]

Authors

Oded Regev

This author has not been identified. Look up 'Oded Regev' in Google