scientific article; zbMATH DE number 3908519

zbMATH Open0569.10014MaRDI QIDQ3686779FDOQ3686779

Authors: Bettina Helfrich 

Publication date: 1985

Title of this publication is not available (Why is that?)

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

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)

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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)