Mathematics of Operations Research · 2009 · 23 citations · 18 references
Natural SciencesComputer ScienceMathematicsNumber TheoryCombinatorial Number Theory
The largest integer that cannot be represented as a nonnegative integral combination of given set of positive integers is called the Frobenius number of these integers. We show that the asymptotic growth of the Frobenius number on average is significantly slower than the growth of the maximum Frobenius number.
18
Lattice translates of a polytope and the Frobenius problem
Ravi Kannan · COMBINATORICA · 1992 · 193 citations
On a linear diophantine problem of Frobenius
Péter L. Erdős, Ron Graham · Acta Arithmetica · 1972 · 143 citations · Full text
Complexity of the Frobenius problem
J. L. Ram�rez-Alfons�n · COMBINATORICA · 1996 · 127 citations