J.-Y. Cai, A. Nerurkar, "Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions," Computational Complexity, Annual IEEE Conference on, pp. 46, 13th Annual IEEE Conference on Computational Complexity (CoCo'98), 1998.

@article{ 10.1109/CCC.1998.694590,
author = {J.-Y. Cai and A. Nerurkar},
title = {Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions},
journal ={Computational Complexity, Annual IEEE Conference on},
volume = {0},
year = {1998},
issn = {1093-0159},
pages = {46},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.1998.694590},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}

TY - CONF
JO - Computational Complexity, Annual IEEE Conference on
TI - Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions
SN - 1093-0159
SP
EP
A1 - J.-Y. Cai,
A1 - A. Nerurkar,
PY - 1998
VL - 0
JA - Computational Complexity, Annual IEEE Conference on
ER -