GapSVP ∈ NP
Statement
For every , the promise problem (GapSVP) is in NP: on a yes-instance, a nonzero lattice vector of norm at most is a witness that the verifier checks by solving a linear system over the integers — folklore.
Notes
- The complement is in for with a suitable constant (GapSVP ∈ coNP) — AR04 — and in for for a constant (GapSVP ∈ coAM) — GG00.