Computing a Frobenius Coin Problem decision problem in O(n^2)

Details Computing a Frobenius Coin Problem decision problem in O(n^2) Computing a Frobenius Coin Problem decision problem in O(n^2)

2010-01-06

arxiv.org/abs/1001.0961v3

Computer Science

Data Structures and Algorithms

7 pages, 0 figures; corrected misspelling of Chemakani's name, reformated, added larger images of algorithm listings

Scientific paper

Expanding on recent results of another an algorithm is presented that
provides solution to the Frobenius Coin Problem in worst case O(n^2) in the
magnitude of the largest denomination.

Affiliated with

Also associated with

No associations

Rating

Computing a Frobenius Coin Problem decision problem in O(n^2) 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 Computing a Frobenius Coin Problem decision problem in O(n^2), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing a Frobenius Coin Problem decision problem in O(n^2) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-372825