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

2010/01/06 by Charles Sauerbier, Sauerbier, Charles
Computer Science · Mathematics · #Advanced Algebra and Geometry #Coding theory and cryptography #Data Structures and Algorithms (cs.DS) #F.2.1 #FOS: Computer and information sciences #Finite Group Theory Research #G.2

paper · pdf · doi:10.48550/arxiv.1001.0961

openalex publication_date 2010/01/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Related

• Short Proof: Exact Solution to the Finite Frobenius Coin Problem
• On the Frobenius Coin Problem in Three Variables
• A new Rational Generating Function for the Frobenius Coin Problem
• Teaching perspectives of the Frobenius coin problem of two denominators
• An inductive proof of the Frobenius coin problem of two denominations