scientific article; zbMATH DE number 4175020

MaRDI QIDQ3199485zbMATH OpenFDO

Authors Loïc Pottier

Publication date 1990

zbMATH Keywords

algorithmgeneratorsintegral solutionslinear diophantine systemssimply exponential upper bounds

Mathematics Subject Classification ID

Integer programming (90C10) Linear Diophantine equations (11D04)

Recommendations

• scientific article; zbMATH DE number 3995771
• A polynomial algorithm for solving systems of two linear diophantine equations
• An efficient incremental algorithm for solving systems of linear diophantine equations
• Algorithms for solving systems of linear Diophantine equations in integer domains
• scientific article; zbMATH DE number 176134

Cited in

(9)

• On a transport problem and monoids of non-negative integers
• scientific article; zbMATH DE number 3995771 (Why is no real title available?)
• Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
• Algorithmic Number Theory
• Siegel's lemma is sharp for almost all linear systems
• Minimal solutions of linear diophantine systems : bounds and algorithms
• The regularity of a toric variety
• Processor lower bound formulas for array computations and parametric Diophantine systems
• Numerical semigroups in a problem about cost-effective transport

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 Q3199485)