Abstract
In [2], we proposed the EZ-GCD algorithm based on extended Hensel construction, in order to compute the GCD of multivariate polynomials. The extended Hensel construction is a specify factorization into algebraic function, and it is efficient for sparse multivariate polynomials. However, it is slower than Maple's GCD routine. In this paper, we improve our EZ-GCD algorithm efficiency.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
