Computing a Lattice Basis Revisited

Autor: Phong Q. Nguyen, Jianwei Li

Publikováno v: ISSAC '19: International Symposium on Symbolic and Algebraic Computation
ISSAC '19: International Symposium on Symbolic and Algebraic Computation, Jul 2019, Beijing, China. pp.275-282, ⟨10.1145/3326229.3326265⟩
ISSAC

Given (a,b) \in \mZ^2, Euclid's algorithm outputs the generator \gcd(a,b) of the ideal a\mZ + b\mZ. Computing a lattice basis is a high-dimensional generalization: given \mathbfa _1,\dots,\veca _n \in \mZ^m, find a \mZ-basis of the lattice L=\ \sum_i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b0bb16e9e5585dc5e113396010f2dbb
https://inria.hal.science/hal-03067825/file/Basis_algorithm2018-4.pdf