ASKSAGE: Sage Q&A Forum - RSS feedhttps://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Fri, 14 Jul 2017 00:06:02 +0200in my algorithm i am doing gcd of two polynomial over prime field.https://ask.sagemath.org/question/37749/in-my-algorithm-i-am-doing-gcd-of-two-polynomial-over-prime-field/ polynomial f1
polynomial f2
f3= gcd(f1,f2)
there is any method to improve speed of gcd computation over prime field Wed, 31 May 2017 10:20:58 +0200https://ask.sagemath.org/question/37749/in-my-algorithm-i-am-doing-gcd-of-two-polynomial-over-prime-field/Comment by vdelecroix for <p>polynomial f1
polynomial f2
f3= gcd(f1,f2)</p>
<p>there is any method to improve speed of gcd computation over prime field </p>
https://ask.sagemath.org/question/37749/in-my-algorithm-i-am-doing-gcd-of-two-polynomial-over-prime-field/?comment=38245#post-id-38245You should start by writing a complete example.Fri, 14 Jul 2017 00:06:02 +0200https://ask.sagemath.org/question/37749/in-my-algorithm-i-am-doing-gcd-of-two-polynomial-over-prime-field/?comment=38245#post-id-38245