The diophantine problem of Frobenius: A close bound

DOI10.1016/0166-218X(89)90019-XMaRDI QIDQ1119676zbMATH OpenFDO

Authors Hugo Krawczyk, Azaria Paz

Publication date 1989

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

conductoralgorithmpolynomialFrobenius numberFrobenius problemlinear diophantine equations

Mathematics Subject Classification ID

Linear Diophantine equations (11D04)

Recommendations

• On the linear diophantine problem of Frobenius
• scientific article; zbMATH DE number 18540
• Frobenius' problem
• scientific article; zbMATH DE number 4006336
• On a linear diophantine problem of Frobenius

Cites work

• scientific article; zbMATH DE number 3910473 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3176160 (Why is no real title available?)
• A Minimal-Path Algorithm for the "Money Changing Problem"
• Integer Programming with a Fixed Number of Variables
• On a Problem of Partitions
• On the linear diophantine problem of Frobenius.
• Representations of integers by linear forms in nonnegative integers

Cited in

(4)

• A relation between the knapsack and group knapsack problems
• A diophantine problem of Frobenius in terms of the least common multiple
• An enumeration algorithm for all integers nonrepresentable by some positive integers
• Lattice translates of a polytope and the Frobenius problem

This page was built for publication: The diophantine problem of Frobenius: A close bound

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