| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401932 | Journal of Symbolic Computation | 2008 | 7 Pages |
Abstract
A Gröbner 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
