Abstract
This paper examines the time for computing integer powers of a class of polynomials in one or several variables. A member f of the class of “sparse” polynomials can be characterized by the number of nonzero terms, t, in the representation of f. Where, for power 4, the most obvious methods result in multiplications, a method is presented which requires fewer than multiplications.This algorithm requires, for t » n » 1 about tn/n! + O(tn − 1 /(2(n − 2)!)) multiplications, which is proved to be a lower‐bound on the computation.
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.
