oldk1331 wrote:
>
> I'm certain that extendedEuclidean get stuck simply because the
> intermediate expression is too big. See the attachment for details.
>
> The original Lazard/Rioboo paper used extendedEuclidean too.
> But extendedEuclidean can be more expensive than factor...
>
> I think the only solutioin is to limit the size of arguments passed
> to extendedEuclidean, or limit the time of extendedEuclidean can run.
> (Limit the coefficient type to INT or FRAC INT is not good enough.)
One can use better algorithm for extendedEuclidean. IIRC for
plain gcd we use modular algorithm, but for extendedEuclidean
we use subresultants...
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to fricas-devel+unsubscr...@googlegroups.com.
To post to this group, send email to fricas-devel@googlegroups.com.
Visit this group at https://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
