Abstract
In this paper we describe a fast algorithm for counting the number of roots of complex polynomials in the open unit disk, classically called the Schur–Cohn problem. For degree d polynomials our bound is of order dlog2d in terms of field operations and comparisons, but our approach nicely allow us to integrate the bit size as a further complexity parameter as well. For bit size σ of input polynomials of Z[X] our running time is of order d2σ·log(dσ)·loglog(dσ)·log(d) in the multi-tape Turing machine model, thus improving all previously proposed approaches.
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.
