Abstract
We give a polynomial time Turing reduction from the γ2 √n-approximate closest vector problem on a lattice of dimension n to a γ-approximate oracle for the shortest vector problem. This is an improvement over a reduction by Kannan, which achieved γ2 n3/2. © 2011 Springer-Verlag.
Cite
CITATION STYLE
APA
Dubey, C., & Holenstein, T. (2011). Approximating the closest vector problem using an approximate shortest vector oracle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6845 LNCS, pp. 184–193). https://doi.org/10.1007/978-3-642-22935-0_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free