La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász

DOI10.1051/ita/1989230303451zbMath0692.10032OpenAlexW2293540894MaRDI QIDQ3033847

Brigitte Vallée

Publication date: 1989

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92339

zbMATH Keywords

complexitybibliographyreduced basiscomputational number theorylattice reductionexpository paperLenstra-Lenstra-Lovász algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)

Related Items (1)

Random lattices, threshold phenomena and efficient reduction algorithms.

Cites Work

• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
• Solvability by radicals is in polynomial time
• On Lovász' lattice reduction and the nearest lattice point problem
• Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Integer Programming with a Fixed Number of Variables
• Solving low-density subset sum problems
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• Best Simultaneously Diophantine Approximations. I. Growth Rates of Best Approximation Denominators
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász