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

From MaRDI portal
Revision as of 00:33, 19 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
scientific article

    Statements

    Lattice basis reduction: Improved practical algorithms and solving subset sum problems (English)
    0 references
    0 references
    0 references
    11 December 1994
    0 references
    A practical floating point \(L^3\)-algorithm, \(L^3FP\), is presented that shows good stability according to empirical tests up to dimension 125 with integer entries of bit length up to 300. Moreover, a practical algorithm for block Korkin-Zolotarev reduction is proposed, and a variant of the Lenstra-Lenstra-Lovasz \(L^3\)-algorithm is introduced that uses ``deep insertions''. For all the algorithms presented computational performance in solving subset sum problems is reported.
    0 references
    0 references
    lattice basis reduction
    0 references
    floating point \(L^ 3\)-algorithm
    0 references
    block Korkin- Zolotarev reduction
    0 references
    subset sum
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references