TY - GEN
T1 - Lattice basis reduction with dynamic approximation
AU - Backes, Werner
AU - Wetzel, Susanne
PY - 2001
Y1 - 2001
N2 - In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the new heuristic is more efficient in reducing large problem instances and extends the applicability of the Schnorr-Euchner algorithm such that problem instances that the state-of-the-art method fails to reduce can be solved using our new technique.
AB - In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the new heuristic is more efficient in reducing large problem instances and extends the applicability of the Schnorr-Euchner algorithm such that problem instances that the state-of-the-art method fails to reduce can be solved using our new technique.
UR - http://www.scopus.com/inward/record.url?scp=84896765422&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84896765422&partnerID=8YFLogxK
U2 - 10.1007/3-540-44691-5_6
DO - 10.1007/3-540-44691-5_6
M3 - Conference contribution
AN - SCOPUS:84896765422
SN - 3540425128
SN - 9783540425120
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 63
EP - 73
BT - Algorithm Engineering - 4th International Workshop, WAE 2000, Proceedings
A2 - Naher, Stefan
A2 - Wagner, Dorothea
T2 - 4th International Workshop on Algorithm Engineering, WAE 2000
Y2 - 5 September 2000 through 8 September 2000
ER -