scientific article; zbMATH DE number 1313325

MaRDI QIDQ4254898zbMATH OpenFDO

Authors Harald Ritter

Publication date 4 July 1999

zbMATH Keywords

knapsack problems

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Parallel algorithms in computer science (68W10)

Recommendations

• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• A sieve algorithm for the shortest lattice vector problem
• scientific article; zbMATH DE number 2196508
• scientific article; zbMATH DE number 3972987
• Sampling methods for shortest vectors, closest vectors and successive minima

Cited in

(4)

• New \(t\)-designs and large sets of \(t\)-designs
• Search for combinatorial objects using lattice algorithms -- revisited
• Enumerating functions for nonnegative integer coordinates of \(L\)-dimensional vectors
• Enumeration of lattice points in \(l_1\) norm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254898)