A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We prove that the closest vector problem with preprocessing (CVPP) is NP-hard to approximate within any factor less than ffiffi 5 3 q : More specifically, we show that there exists a reduction from an NP-hard problem to the approximate closest vector problem such that the lattice depends only on the size of the original problem, and the specific instance is encoded solely in the target vector. It follows that there are lattices for which the closest vector problem cannot be approximated withindoi:10.1016/j.jcss.2004.01.002 fatcat:buuxtfp63baadll5yhm7gbkzwa