On May 25, 2:22 pm, John Cremona <john.crem...@gmail.com> wrote: > If no-one else is more explicit I'll look for a reference tomorrow.
For the record, off-list John Cremona pointed me to "Fast Algorithms for Linear Algebra mod N" by Storjohann and Mulders, where this is called "stablization of p and q mod r" and there is an (apparently efficient) algorithm given (for integers). Thanks, John. -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
