#15422: factorization of non-squarefree polynomials over the p-adics
-------------------------------------+-------------------------------------
Reporter: jdemeyer | Owner:
Type: defect | Status: positive_review
Priority: major | Milestone: sage-5.13
Component: padics | Resolution:
Keywords: | Merged in:
Authors: Jeroen Demeyer | Reviewers: Robert Bradshaw,
Report Upstream: N/A | David Roe
Branch: | Work issues:
Dependencies: #864, #9640, | Commit:
#10018, #11868 | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by roed):
* status: needs_review => positive_review
* reviewer: Robert Bradshaw => Robert Bradshaw, David Roe
Comment:
Replying to [comment:30 jdemeyer]:
> Given that implementing that additional keyword for "best-effort
factoring" (factor `f` assuming everything which could be a power actually
is a power) is going to take some work, would you agree with merging this
ticket as-is and leaving your suggestion for later?
I definitely think that implementing best-effort factoring should be saved
for another ticket. I'm giving this a positive review, since I think that
a keyword argument is a good compromise. I would like to e-mail `sage-nt`
and `sage-padic` to get some more opinions, but any consensus from that
discussion can be postponed to a follow up ticket.
--
Ticket URL: <http://trac.sagemath.org/ticket/15422#comment:31>
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/groups/opt_out.
