Browsing Mathematics (Faculty of) by Subject "Frobenius problem"
Now showing items 1-1 of 1
-
The Frobenius Problem in a Free Monoid
(University of Waterloo, 2009-08-21)Given positive integers c1,c2,...,ck with gcd(c1,c2,...,ck) = 1, the Frobenius problem (FP) is to compute the largest integer g(c1,c2,...,ck) that cannot be written as a non-negative integer linear combination of c1,c2,...,ck. ...