An improved lower bound for approximating CVPApproximating-CVP to within almost-polynomial factors is NP-hard
