If you create a sparse polynomial ring and use ?? analogously you'll be able to find the source code for gcd. I don't know off the top of my head what algorithm is used. David
On Saturday, March 25, 2023 at 5:36:18 PM UTC-4 jaysha...@gmail.com wrote: > I want know that which algorithms sagemath used for computing the gcd of > sparse polynomial calculation. > Please also know provide the source of that where can I find this > algorithms > > On Sat, 25 Mar, 2023, 02:06 Jay Sharma, <jaysha...@gmail.com> wrote: > >> I want to know that for sparse and dense polynomials which gcd algorithms >> does sagemath uses ? >> >> -- >> You received this message because you are subscribed to the Google Groups >> "sage-gsoc" group. >> To unsubscribe from this group and stop receiving emails from it, send an >> email to sage-gsoc+...@googlegroups.com. >> To view this discussion on the web visit >> https://groups.google.com/d/msgid/sage-gsoc/cb8f9e55-be48-400e-925b-e0f1a75c5846n%40googlegroups.com >> >> <https://groups.google.com/d/msgid/sage-gsoc/cb8f9e55-be48-400e-925b-e0f1a75c5846n%40googlegroups.com?utm_medium=email&utm_source=footer> >> . >> > -- You received this message because you are subscribed to the Google Groups "sage-gsoc" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-gsoc+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-gsoc/40bd4ae9-38f9-4c50-9d08-d3bc814722ddn%40googlegroups.com.
