#15513: Polynomial factorization over generic fields
---------------------------------+------------------------
Reporter: nthiery | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.4
Component: factorization | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------+------------------------
Comment (by nthiery):
Oh, wait, wait, wait, where is my mind ... Yes, of course factorization
over K[x] for K=QQ, CC, ... is completely different; I am even
illustrating this in my usuals intros to Sage :-)
So, let's see. What I had in mind was indeed generic factorization
algorithm for the standard constructions of fields from existing ones.
Ok, I'll try now to rewrite the description in a proper way. It's not my
area, so please clarify it :-)
--
Ticket URL: <http://trac.sagemath.org/ticket/15513#comment:26>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
