A hierarchy of polynomial time lattice basis reduction algorithms
Open Access
- 1 January 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 53 (2-3), 201-224
- https://doi.org/10.1016/0304-3975(87)90064-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Algorithms to construct minkowski reduced and hermite reduced lattice basesTheoretical Computer Science, 1985
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Worst-case complexity bounds for algorithms in the theory of integral quadratic formsJournal of Algorithms, 1980
- Ueber die positiven quadratischen Formen und über kettenbruchähnliehe Algorithmen.Journal für die reine und angewandte Mathematik (Crelles Journal), 1891
- Sur les formes quadratiquesMathematische Annalen, 1873
- Extraits de lettres de M. Ch. Hermite à M. Jacobi sur différents objects de la théorie des nombres. (Continuation).Journal für die reine und angewandte Mathematik (Crelles Journal), 1850