
"On the Complexity of Lattice Problems with Polynomial Approximation Factors."
Oded Regev (2010)
- Oded Regev:
On the Complexity of Lattice Problems with Polynomial Approximation Factors. The LLL Algorithm 2010: 475-496

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.