-
-
Notifications
You must be signed in to change notification settings - Fork 479
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.
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
use NTL's MinPolyMod() #34906
Comments
This comment has been minimized.
This comment has been minimized.
comment:4
you could add the doi to the reference https://doi.org/10.1145/309831.309859 so |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:6
Sure, why not. Done. |
comment:7
one failing doctest, see patchbot, that seems to be related to the changes done here |
comment:8
Sorry, that's a new test I added (and promptly got wrong). Fixing shortly. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:10
ok, I will give a positive review, unless you want to ask some more qualified expert in the domain |
Reviewer: Frédéric Chapoton |
comment:11
Thank you! |
Changed branch from public/use_NTL_MinPolyMod to |
NTL implements Shoup's algorithm https://shoup.net/papers/mpol.pdf for minimal polynomials of algebraic elements over finite fields.
This patch adds call paths from
PolynomialQuotientRingElement.minpoly()
andRingExtensionWithBasisElement.minpoly()
to NTL'sMinPolyMod()
function, yielding massive speedups in some important special cases.Example code:
Sage 9.7:
This branch:
Component: algebra
Author: Lorenz Panny
Branch/Commit:
d230ff8
Reviewer: Frédéric Chapoton
Issue created by migration from https://trac.sagemath.org/ticket/34906
The text was updated successfully, but these errors were encountered: