in my algorithm i am doing gcd of two polynomial over prime field.

asked 2017-05-31 10:20:58 +0100

This post is a wiki. Anyone with karma >750 is welcome to improve it.

polynomial f1 polynomial f2 f3= gcd(f1,f2)

there is any method to improve speed of gcd computation over prime field

edit retag flag offensive close merge delete

Comments

You should start by writing a complete example.

vdelecroix ( 2017-07-14 00:06:02 +0100 )edit

add a comment

Be the first one to answer this question!

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower

Stats

Asked: 2017-05-31 10:20:58 +0100

Seen: 183 times

Last updated: May 31 '17

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.

in my algorithm i am doing gcd of two polynomial over prime field. edit

Comments

Be the first one to answer this question!

Question Tools

Stats

in my algorithm i am doing gcd of two polynomial over prime field.