I may be implementing something like this for p-adics soon. It's one of the options for doing gcds meaningfully. If anyone else is interested in working on this, get in touch with me. David
On 5/17/07, Michel <[EMAIL PROTECTED]> wrote: > > > It is rather frustrating that sage does not a have a gcd algorithm > for > multivariate polynomials over generic fields. > > There is such an algorithm. It is called the "subresultant" algorithm. > It is for example described > in Knuth's book "Semi-numerical algorithms" in section 4.6.1. > > Does anybody have experience with this algorithm? Does it perform > acceptably? I think Magma > uses it as a fallback if more specialized algorithms fail. > > Michel > > > > > --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
