Computing a Frobenius Coin Problem decision problem in O(n^2)
Data Structures and Algorithms
2010-01-08 v3
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.
Cite
@article{arxiv.1001.0961,
title = {Computing a Frobenius Coin Problem decision problem in O(n^2)},
author = {Charles Sauerbier},
journal= {arXiv preprint arXiv:1001.0961},
year = {2010}
}
Comments
7 pages, 0 figures; corrected misspelling of Chemakani's name, reformated, added larger images of algorithm listings