Abstract
The number of addition-subtraction operations required to compute univariate pol nomials is investigated. The existence of rational coefficient polynomials of degree n requiring $ \sim (\sqrt n ) \pm $ operations is established using an argument based on algebraic independence. A more analytic argument is used to relate $ \pm $ complexity to the number of distinct real zeros possessed by a given real coefficient polynomial.
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.
