Solving Thousand Digit Frobenius Problems Using Grobner Bases

Details Solving Thousand Digit Frobenius Problems Using Grobner Bases Solving Thousand Digit Frobenius Problems Using Grobner Bases

2007-02-02

arxiv.org/abs/math/0702040v2

Journal of Symbolic Computation, Volume 43, Issue 1, January 2008, Pages 1-7

Mathematics

Combinatorics

7 pages. See http://www.broune.com/ for associated benchmarks and software. Version 2 includes some minor corrections

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Solving Thousand Digit Frobenius Problems Using Grobner Bases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving Thousand Digit Frobenius Problems Using Grobner Bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Thousand Digit Frobenius Problems Using Grobner Bases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-676062