scientific article; zbMATH DE number 3908519

MaRDI QIDQ3686779zbMATH OpenFDO

Authors Bettina Helfrich

Publication date 1985

zbMATH Keywords

polynomial timecomputational number theoryLenstra-Lenstra-Lovász algorithm

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Algorithms in computer science (68W99)

Recommendations

• Calculation of Minkowski-reduced lattice bases
• Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
• Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors
• A hierarchy of polynomial time lattice basis reduction algorithms
• The Generalized Basis Reduction Algorithm

Cited in

(8)

• Calculation of Minkowski-reduced lattice bases
• Critical 4-reduced basis and its construction
• Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
• scientific article; zbMATH DE number 4073089 (Why is no real title available?)
• Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors
• On Lovász' lattice reduction and the nearest lattice point problem
• An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
• scientific article; zbMATH DE number 1857498 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686779)