An algorithm for the Frobenius problem

MaRDI QIDQ3536905zbMATH OpenFDO

Authors

Publication date 24 November 2008

zbMATH Keywords

complete sets of residuescongruenceFrobenius problemlinearly representation

Mathematics Subject Classification ID

Linear Diophantine equations (11D04)

Recommendations

• On a problem of Frobenius for an almost consecutive set of integers.
• On the linear diophantine problem of Frobenius
• scientific article; zbMATH DE number 3983264
• Faster algorithms for Frobenius numbers
• On a linear Diophantine problem of Frobenius.

Cited in

(18)

• An application of an optimal behaviour of the greedy solution in number theory
• The Frobenius problem for classes of polynomial solvability.
• Faster algorithms for Frobenius numbers
• 2-variable Frobenius problem in \(\mathbb Z[\sqrt M]\)
• Francis’s Algorithm
• The Frobenius Problem and Maximal Lattice Free Bodies
• An algorithm for solving the Frobenius problem using Gröbner bases
• The Frobenius Problem and Its Generalizations
• Computing the Frobenius number
• scientific article; zbMATH DE number 4068972 (Why is no real title available?)
• scientific article; zbMATH DE number 1262434 (Why is no real title available?)
• scientific article; zbMATH DE number 1320681 (Why is no real title available?)
• scientific article; zbMATH DE number 563183 (Why is no real title available?)
• scientific article; zbMATH DE number 2066386 (Why is no real title available?)
• An enumeration algorithm for all integers nonrepresentable by some positive integers
• The Frobenius problem in a free monoid
• Computing and Combinatorics
• On the Frobenius problem

This page was built for publication: An algorithm for the Frobenius problem

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