arXiv math/07020402007-02math.CO

Solving Thousand Digit Frobenius Problems Using Grobner Bases

Bjarke Hammersholt Roune

备注：: 7 pages. See http://www.broune.com/ for associated benchmarks and software. Version 2 includes some minor corrections
发表信息：: Journal of Symbolic Computation, Volume 43, Issue 1, January 2008, Pages 1-7
DOI：: 10.1016/j.jsc.2008.08.002

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。