Balanced integer solutions of linear equations
From MaRDI portal
Recommendations
- A Sharp Bound on Positive Solutions of Linear Diophantine Equations
- A solution method for a knapsack problem and its variant
- scientific article; zbMATH DE number 4135714
- Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
- New results for aggregating integer-valued equations
Cites work
- A Note on the Linear Diophantine Equation
- Algorithms for the shortest and closest lattice vector problems
- Hiding information and signatures in trapdoor knapsacks
- scientific article; zbMATH DE number 1187155 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1852134 (Why is no real title available?)
- scientific article; zbMATH DE number 1852142 (Why is no real title available?)
- scientific article; zbMATH DE number 2123741 (Why is no real title available?)
- Improved low-density subset sum algorithms
- On the Chor-Rivest knapsack cryptosystem
- Predicting Lattice Reduction
- Solving low-density subset sum problems
- The Magma algebra system. I: The user language
Cited in
(3)
This page was built for publication: Balanced integer solutions of linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926145)