On Sep 8, 2:49 am, Cary Cherng <[email protected]> wrote: > This works but is too slow for more complicated examples. Is there a > way to speed up "x in I" for much bigger examples? Or does this > already use the fastest algorithm based on groebner basis or something > else.
Blind checking if a polynomial is in an ideal is, and will always be, a hard problem. If I recall correctly, it is a exponential-space complete problem. -- 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-support URL: http://www.sagemath.org
