Approximating-CVP to within almost-polynomial factors is NP-hard | IEEE Conference Publication | IEEE Xplore