Computing a Frobenius Coin Problem decision problem in O(n2)
Abstract
Expanding on recent results of another an algorithm is presented that provides solution to the Frobenius Coin Problem in worst case O(n2) in the magnitude of the largest denomination.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.