TY - RPRT
A1 - Kaib, Michael
A1 - Ritter, Harald
T1 - Block reduction for arbitrary norms
N2 - We generalize the concept of block reduction for lattice bases from l2-norm to arbitrary norms. This extends the results of Schnorr. We give algorithms for block reduction and apply the resulting enumeration concept to solve subset sum problems. The deterministic algorithm solves all subset sum problems. For up to 66 weights it needs in average less then two hours on a HP 715/50 under HP-UX 9.05.
Y1 - 2005
UR - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4236
UR - https://nbn-resolving.org/urn:nbn:de:hebis:30-12451
ER -