Thumbnail
Access Restriction
Open

Author Sauerbier, Charles
Source arXiv.org
Content type Text
File Format PDF
Date of Submission 2010-01-06
Language English
Subject Domain (in DDC) Computer science, information & general works
Subject Keyword Computer Science - Data Structures and Algorithms ♦ F.2.1 ♦ G.2 ♦ cs
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.
Educational Use Research
Learning Resource Type Article
Page Count 7


Open content in new tab

   Open content in new tab