Hi all, I wanted to discuss the project "Polynomial GCD" primarily focussing on improving sparse polynomial gcd by adding variants of PRS algorithm for sparse polynomial representation discussed in Improving sparse polynomial gcd #23131 <https://github.com/sympy/sympy/issues/23131>. I have already gone through the code in Issue#20874 <https://github.com/sympy/sympy/issues/20874> where the subresultant PRS algorithm is implemented which can be improved further and added to sympy codebase initially. I could not find references for variants of the PRS algorithm. Could someone suggest any references to learn about various variants of the PRS algorithm that are useful for speeding up sparse polynomials?
Praneeth -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to sympy+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/8a891bd2-b963-48ad-ae86-4bebd19985c4n%40googlegroups.com.
