Solving Thousand Digit Frobenius Problems Using Grobner Bases

Simple item page
dc.creatorRoune, Bjarke Hammersholt
dc.date2007-02-02
dc.date2007-06-04
dc.date.accessioned2026-07-07T12:48:16Z
dc.date.available2026-07-07T12:48:16Z
dc.descriptionA 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.
dc.description7 pages. See http://www.broune.com/ for associated benchmarks and software. Version 2 includes some minor corrections
dc.identifierhttps://arxiv.org/abs/math/0702040
dc.identifierhttp://arxiv.org/abs/math/0702040
dc.identifierJournal of Symbolic Computation, Volume 43, Issue 1, January 2008, Pages 1-7
dc.identifierdoi:10.1016/j.jsc.2008.08.002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221999
dc.subjectCombinatorics
dc.titleSolving Thousand Digit Frobenius Problems Using Grobner Bases
dc.typetext

Files

Collections

arXiv