New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Faster algorithm for large Precise multiplication #12

Open

cooler-king opened this issue Sep 26, 2015 · 0 comments

Labels

Owner

cooler-king commented Sep 26, 2015

There are faster algorithms available for many-digit multiplication (Toom-Cook, Karatsuba).

See https://en.wikipedia.org/wiki/Arbitrary-precision_arithmetic.

cooler-king added the enhancement label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment