Given an n dimensional integer lattice, is it possible to certify a vector as being a shortest one in time polynomial in n?(adsbygoogle = window.adsbygoogle || []).push({});

If we then fix the dimension n, is it possible to certify the shortest-ness in time strictly less than O(k^n) where k is the length of the largest basics vector?

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Certifying shortest vector in a lattice

**Physics Forums | Science Articles, Homework Help, Discussion**