Solving Thousand Digit Frobenius Problems Using Grobner Bases

Journal of Symbolic Computation, Volume 43, Issue 1, January 2008, Pages 1-7 A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irre...

Full description

Saved in:
Bibliographic Details
Main Author Roune, Bjarke Hammersholt
Format Journal Article
LanguageEnglish
Published 02.02.2007
Subjects
Mathematics - Combinatorics
Online AccessGet full text
DOI10.48550/arxiv.math/0702040

Cover

More Information
Summary:Journal of Symbolic Computation, Volume 43, Issue 1, January 2008, Pages 1-7 A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible decompositions and Hilbert functions are also presented.
DOI:10.48550/arxiv.math/0702040