Abstract
We present a parallel algorithm to evaluate a sparse polynomial in Zp[x0, ..., xn] into many bivariate images, based on the fast multi-point evaluation technique described by van der Hoeven and Lecerf [11]. We have implemented the fast parallel algorithm in Cilk C. We present benchmarks demonstrating good parallel speedup for multi-core computers.Our algorithm was developed with a specific application in mind, namely, the sparse polynomial GCD algorithm of Hu and Monagan [6] which requires evaluations of this form. We present benchmarks showing a large speedup for the polynomial GCD problem.
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.
