  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.
