#1819: move crypto.mq.MPolynomialSystem somewhere else
-----------------------------------+----------------------------------------
Reporter: malb | Owner: malb
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.6.2
Component: commutative algebra | Keywords:
Author: Martin Albrecht | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------------+----------------------------------------
Comment(by vbraun):
In principle, it would be nice if the ideal class could represent some
basis-free abstract notion of ideal. In practice, this is not possible as
all non-trivial computations are exponential complexity due to the need
for Groebner bases. Even worse, the Groebner basis computation often
depends on a judiciously chosen term ordering which cannot be automated.
This is why all computer algebra programs that I am aware of treat ideals
as sequences of polynomials, and not as ideals in the mathematical sense.
Barring any breakthrough in algebra it is not feasible to do otherwise.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/1819#comment:14>
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.
