Remark 2 From a complexity theory view point, Problem REF  is NP-hard. Indeed, since the above Steps 0, 1, and 3 are of polynomial complexity, the CVP, which is known to be NP-hard [1]}, is polynomially reduced to Problem REF .

