An algorithm for solving the Frobenius problem using Gröbner bases

MaRDI QIDQ3404324zbMATH OpenFDO

Authors Gilberto García-Pulgarín, John Hermes Castillo Gómez

Publication date 8 February 2010

Full work available at URL http://redalyc.uaemex.mx/src/inicio/ArtPdfRed.jsp?iCve=46816207

Mathematics Subject Classification ID

The Frobenius problem (11D07) Computer solution of Diophantine equations (11Y50) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Recommendations

• An algorithm for the Frobenius problem
• The Frobenius problem for classes of polynomial solvability.
• Faster algorithms for Frobenius numbers
• On a linear Diophantine problem of Frobenius.
• The Frobenius Problem and Its Generalizations

Cited in

(5)

• Solving thousand-digit Frobenius problems using Gröbner bases
• scientific article; zbMATH DE number 1714661 (Why is no real title available?)
• scientific article; zbMATH DE number 1241621 (Why is no real title available?)
• scientific article; zbMATH DE number 1262434 (Why is no real title available?)
• An enumeration algorithm for all integers nonrepresentable by some positive integers

Describes a project that uses

Uses Software

• MuPAD

This page was built for publication: An algorithm for solving the Frobenius problem using Gröbner bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404324)