Computing a Frobenius Coin Problem decision problem in O(n^2)

Abstract

Expanding on recent results of another an algorithm is presented that provides solution to the Frobenius Coin Problem in worst case O(n^2) in the magnitude of the largest denomination.

7 pages, 0 figures; corrected misspelling of Chemakani's name, reformated, added larger images of algorithm listings

References in corpus (2)

• An extension of the Frobenius coin-exchange problem
• A new Rational Generating Function for the Frobenius Coin Problem