A deterministic algorithm for modular knapsack problems

DOI10.1016/0304-3975(91)90077-FzbMATH Open0733.68043OpenAlexW2087851677MaRDI QIDQ809609FDOQ809609

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)

Cites Work

• Hiding information and signatures in trapdoor knapsacks
• Title not available (Why is that?)

Cited In (1)

• Lattice Reduction for Modular Knapsack

   Recommendations

• Title not available (Why is that?) 👍 👎
• A New Algorithm for the Solution of the Knapsack Problem 👍 👎
• Solving Low Density Knapsacks 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)