Computing a lattice basis from a system of generating vectors

DOI10.1007/3-540-51517-8_89zbMath1209.11108OpenAlexW1531726993MaRDI QIDQ5393303

Michael E. Pohst, Johannes A. Buchmann

Publication date: 16 April 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-51517-8_89

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items (4)

The special case of cyclotomic fields in quantum algorithms for unit groups ⋮ Practical algorithms for polycyclic matrix groups ⋮ A Numerical Transcendental Method in Algebraic Geometry: Computation of Picard Groups and Related Invariants ⋮ On the quantum complexity of the continuous hidden subgroup problem

This page was built for publication: Computing a lattice basis from a system of generating vectors