• DOI:10.1007/BF01581144
Corpus ID: 15386054

Lattice basis reduction: Improved practical algorithms and solving subset sum problems

@article{Schnorr1994LatticeBR,
  title={Lattice basis reduction: Improved practical algorithms and solving subset sum problems},
  author={C. Schnorr and M. Euchner},
  journal={Mathematical Programming},
  year={1994},
  volume={66},
  pages={181-199}
}

• C. Schnorr, M. Euchner
• Published 1994
• Mathematics, Computer Science
• Mathematical Programming

We report on improved practical algorithms for lattice basis reduction. We propose a practical floating point version of theL3-algorithm of Lenstra, Lenstra, Lovász (1982). We present a variant of theL3-algorithm with “deep insertions” and a practical algorithm for block Korkin—Zolotarev reduction, a concept introduced by Schnorr (1987). Empirical tests show that the strongest of these algorithms solves almost all subset sum problems with up to 66 random weights of arbitrary bit length within… Expand

View on Springer

publikationen.ub.uni-frankfurt.de

Save to Library

Create Alert

Cite

Launch Research Feed