On the linear diophantine problem of Frobenius (Q1335265)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 645303
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the linear diophantine problem of Frobenius |
scientific article; zbMATH DE number 645303 |
Statements
On the linear diophantine problem of Frobenius (English)
0 references
28 September 1994
0 references
Concerning the Frobenius problem with \(n=3\) a new lower bound and another proof of a well known upper bound for the largest non representable integer \(g=g(a_ 1,a_ 2,a_ 3)\) is given. Further the author discusses a polynomial time algorithm for the computation of \(g\) and some open problems.
0 references
linear diophantine equations
0 references
Frobenius problem
0 references
new lower bound
0 references
upper bound
0 references
polynomial time algorithm
0 references
0 references
0.99705344
0 references
0.99705344
0 references
0.95735276
0 references
