On polynomial-time solvable linear Diophantine problems
Author:
- 11 October 2019
- journal article
- Published by Mathematical Sciences Publishers in Moscow Journal of Combinatorics and Number Theory
- Vol. 8 (4) , 357-365
Abstract
No abstract availableAll Related Versions
This publication has 12 references indexed in Scilit:
- LLL-reduction for integer knapsacksJournal of Combinatorial Optimization, 2011
- Perfect Lattices in Euclidean Spaces2003
- Gradient elements of the knapsack polytopeCalcolo, 2001
- Geometric Algorithms and Combinatorial Optimization1988
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- Some polyhedra related to combinatorial problemsLinear Algebra and its Applications, 1969
- An Introduction to the Geometry of Numbers1959
- On a Problem of Partitions IIAmerican Journal of Mathematics, 1954
- On a Problem of PartitionsAmerican Journal of Mathematics, 1942