Solving Thousand Digit Frobenius Problems Using Grobner Bases
classification
🧮 math.CO
keywords
frobeniussolvingalgorithmgrobnerpresentedproblembasesbasis-based
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.