Solving thousand-digit Frobenius problems using Grobner bases
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. (c) 2007 Elsevier Ltd. All rights reserved.
frobenius problem irreducible decomposition hilbert function groebner basis