A deterministic algorithm for modular knapsack problems

DOI10.1016/0304-3975(91)90077-FMaRDI QIDQ809609zbMATH OpenOpenAlexFDO

Authors Arto Salomaa

Publication date 1991

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(91)90077-f

zbMATH Keywords

knapsack vectormodular knapsack problemsuper-increasing vector

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4199638
• A New Algorithm for the Solution of the Knapsack Problem
• Solving low density knapsacks
• scientific article; zbMATH DE number 3880121
• scientific article; zbMATH DE number 4031399

Cites work

• Hiding information and signatures in trapdoor knapsacks
• scientific article; zbMATH DE number 3902039 (Why is no real title available?)

Cited in

(4)

• scientific article; zbMATH DE number 4199638 (Why is no real title available?)
• Lattice Reduction for Modular Knapsack
• scientific article; zbMATH DE number 4098719 (Why is no real title available?)
• Solving low density knapsacks

This page was built for publication: A deterministic algorithm for modular knapsack problems

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