On the linear diophantine problem of Frobenius
From MaRDI portal
Publication:1335265
DOI10.1006/jnth.1994.1071zbMath0805.11025MaRDI QIDQ1335265
Publication date: 28 September 1994
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jnth.1994.1071
upper bound; polynomial time algorithm; Frobenius problem; linear diophantine equations; new lower bound
Related Items
Frobenius Coin-Exchange Generating Functions, Some Experimental Results on the Frobenius Problem, The Frobenius problem for repunit numerical semigroups., Formulae for the Frobenius number in three variables, On Frobenius numbers for symmetric (not complete intersection) semigroups generated by four elements, Expected Frobenius numbers, Numerical semigroups: Apéry sets and Hilbert series., Geometric proof of Rødseth's formula for Frobenius numbers, An optimal lower bound for the Frobenius problem, Frobenius problem for semigroups \(\mathbf S(d_1,d_2,d_3)\)., The Frobenius problem, rational polytopes, and Fourier-Dedekind sums, Refined upper bounds for the linear Diophantine problem of Frobenius, The Frobenius problem for Thabit numerical semigroups, On the genus of a quotient of a numerical semigroup, The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus, The Frobenius Problem and Its Generalizations
