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

Gaussian integers worklist #433

Open

fredrik-johansson opened this issue Jul 2, 2022 · 0 comments

Collaborator

fredrik-johansson commented Jul 2, 2022

Implement the improved division algorithm from https://dl.acm.org/doi/pdf/10.1145/800205.806321 (or something similar)
Optimize gcd_euclidean_improved up to 2 or more words
Optimize gcd_binary and extend the range
Lehmer GCD
Subquadratic GCD
Dan's GCD algorithm
XGCD
Handle pure real/imaginary input everywhere
Divisibility testing, valuation
Primality testing
Prime enumeration
Factoring (full and smooth)
Norm approximation / fast norm comparison

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