#5074: singular factorization over GF(p) need not be a complete factorization
-----------------------------------+----------------------------------------
Reporter: was | Owner: malb
Type: defect | Status: needs_info
Priority: major | Milestone: sage-4.6.1
Component: commutative algebra | Keywords: factorisation
Author: | Upstream: Reported upstream. Little or
no feedback.
Reviewer: | Merged:
Work_issues: |
-----------------------------------+----------------------------------------
Changes (by malb):
* keywords: => factorisation
* status: needs_work => needs_info
* upstream: Fixed upstream, in a later stable release. => Reported
upstream. Little or no feedback.
Comment:
I've written a little script to check the quality of factorisation. While
I didn't get any wrong answer so far, factorisation sometimes takes ages.
This is ticket #291 in the Singular bug tracker: http://www.singular.uni-
kl.de:8002/trac/ticket/291
Strictly speaking, this ticket could be closed (modulo review of the patch
etc) since there are no known examples where the wrong factorisation is
returned. Alternatively, we could wait for the performance issue to be
resolved in Singular.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5074#comment:7>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
