Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- 1 August 1994
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 66 (1-3) , 181-199
- https://doi.org/10.1007/bf01581144
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Improved low-density subset sum algorithmscomputational complexity, 1992
- Improving the critical density of the Lagarias-Odlyzko attack against subset sum problemsPublished by Springer Nature ,1991
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal latticeCombinatorica, 1990
- Polynomial Time Algorithms for Finding Integer Relations among Real NumbersSIAM Journal on Computing, 1989
- A knapsack-type public key cryptosystem based on arithmetic in finite fieldsIEEE Transactions on Information Theory, 1988
- Minkowski's Convex Body Theorem and Integer ProgrammingMathematics of Operations Research, 1987
- On the Lagarias-Odlyzko Algorithm for the Subset Sum ProblemSIAM Journal on Computing, 1986
- Solving low-density subset sum problemsJournal of the ACM, 1985
- 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