Factorization properties of lattices over the integers

DOI10.1016/0024-3795(93)00069-CzbMath0824.11073OpenAlexW2090290054MaRDI QIDQ1345515

Azaria Paz, Mody Lempel

Publication date: 15 November 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(93)00069-c

zbMATH Keywords

integral latticesfactorizationpolynomial time algorithmsextended GCD algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Integer Programming with a Fixed Number of Variables
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• The complexity of computing the covering radius of a code
• On the complexity of some coding problems (Corresp.)
• On the inherent intractability of certain coding problems (Corresp.)
• Systems of distinct representatives and linear algebra
• Algorithm and bound for the greatest common divisor of n integers
• A New Version of the Euclidean Algorith

This page was built for publication: Factorization properties of lattices over the integers