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

TL;DR

This paper presents an algorithm that solves the Frobenius Coin Problem efficiently in quadratic time relative to the largest denomination, improving computational feasibility for large coin sets.

Contribution

The paper introduces a new algorithm that determines the Frobenius Coin Problem in worst-case quadratic time based on the largest denomination, advancing previous methods.

Findings

Algorithm solves the problem in O(n^2) time

Efficiency depends on the magnitude of the largest denomination

Provides a practical approach for large coin sets

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.