Abstract
In this article, we present a survey of known inapproximability results for computational problems on lattices, viz. the Shortest Vector Problem (SVP), the Closest Vector Problem (CVP), the Closest Vector Problem with Preprocessing (CVPP), the Covering Radius Problem (CRP), the Shortest Independent Vectors Problem (SIVP), and the Shortest Basis Problem (SBP).
Cite
CITATION STYLE
APA
Khot, S. (2010). Inapproximability results for computational problems on lattices. In Information Security and Cryptography (Vol. 10, pp. 453–473). Springer International Publishing. https://doi.org/10.1007/978-3-642-02295-1_14
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