Before revision:  By assuming the existence of a poly(n)-space and 2^{O(n) .
After revision:  By assuming the existence of a poly(n)-space and 2^{O(n). Using the enumeration and sparsification tools developped by Dadush, Kun, Peikert and Vempala, this leads to a simple alternative to the boosting procedure for CVP under \ell_p-norms. This connection might be of independent interest .