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
Böcker S, Lipták Z. The Money Changing Problem revisited: Computing the Frobenius number in time O(k...
Let p = ( p 1 ,…, p n ) be a vector of positive integers whose greatest common divisor is unity. The...
Given a positive integer n and a set of relatively prime positive integers a1 , ..., ak ,\ud we say ...
The largest integer that cannot be represented as a nonnegative integral combination of given set of...
Given a primitive positive integer vector a, the Frobenius number F(a) is the largest integer that c...
Given unlimited supply of N \u3e 1 types of objects of respective integer weights a_1,...,a_N and c...
Given a matrix A ∈ Zm×n satisfying certain regularity assumptions, we consider the set F(A) of all v...
Let N \u3e 1 be an integer, and let 1 \u3c a_1 \u3c ... \u3c a_N be relatively prime integers. Frob...
We introduce and review the Frobenius Problem, determining the greatest integer not expressible as a...
Let N ≥ 2 and let 1 \u3c a1 \u3c⋯\u3c aN be relatively prime integers. The Frobenius number of this ...
The Frobenius problem is about finding the largest integer that is not contained in the numerical se...
AbstractLet N≥2 and let 1<a1<⋯<aN be relatively prime integers. The Frobenius number of this N-tuple...
TheMoneyChangingProblem(alsoknownasEqualityCon- strained Integer Knapsack Problem) is as follows: L...
Given a matrix $A\in\mathbb{Z}^{m\times n}$ satisfying certain regularity assumptions, we consider t...
AbstractGiven a primitive positive integer vector a, the Frobenius number F(a) is the largest intege...
Böcker S, Lipták Z. The Money Changing Problem revisited: Computing the Frobenius number in time O(k...
Let p = ( p 1 ,…, p n ) be a vector of positive integers whose greatest common divisor is unity. The...
Given a positive integer n and a set of relatively prime positive integers a1 , ..., ak ,\ud we say ...
The largest integer that cannot be represented as a nonnegative integral combination of given set of...
Given a primitive positive integer vector a, the Frobenius number F(a) is the largest integer that c...
Given unlimited supply of N \u3e 1 types of objects of respective integer weights a_1,...,a_N and c...
Given a matrix A ∈ Zm×n satisfying certain regularity assumptions, we consider the set F(A) of all v...
Let N \u3e 1 be an integer, and let 1 \u3c a_1 \u3c ... \u3c a_N be relatively prime integers. Frob...
We introduce and review the Frobenius Problem, determining the greatest integer not expressible as a...
Let N ≥ 2 and let 1 \u3c a1 \u3c⋯\u3c aN be relatively prime integers. The Frobenius number of this ...
The Frobenius problem is about finding the largest integer that is not contained in the numerical se...
AbstractLet N≥2 and let 1<a1<⋯<aN be relatively prime integers. The Frobenius number of this N-tuple...
TheMoneyChangingProblem(alsoknownasEqualityCon- strained Integer Knapsack Problem) is as follows: L...
Given a matrix $A\in\mathbb{Z}^{m\times n}$ satisfying certain regularity assumptions, we consider t...
AbstractGiven a primitive positive integer vector a, the Frobenius number F(a) is the largest intege...
Böcker S, Lipták Z. The Money Changing Problem revisited: Computing the Frobenius number in time O(k...
Let p = ( p 1 ,…, p n ) be a vector of positive integers whose greatest common divisor is unity. The...
Given a positive integer n and a set of relatively prime positive integers a1 , ..., ak ,\ud we say ...
DOI
Add to ORKG