Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 6 Jan 2010 in cs.DS | (1001.0961v3)

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

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up