Re: [sage-gsoc] GCD algorithms

2023-03-26 Thread tcscrims
You can see the path in the output of `??`. Best, Travis On Sunday, March 26, 2023 at 4:30:11 PM UTC+9 jaysha...@gmail.com wrote: > Yeah, I create the ring and use > Can you give the path, where can I get the source code? > > On Sun, 26 Mar, 2023, 03:07 David Roe, wrote: > >> If you create a s

Re: [sage-gsoc] GCD algorithms

2023-03-26 Thread Jay Sharma
Yeah, I create the ring and use Can you give the path, where can I get the source code? On Sun, 26 Mar, 2023, 03:07 David Roe, wrote: > 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 algo

Re: [sage-gsoc] GCD algorithms

2023-03-25 Thread David Roe
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 sagemat

Re: [sage-gsoc] GCD algorithms

2023-03-25 Thread Jay Sharma
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, wrote: > I want to know that for sparse and dense polynomials which gcd alg