By Topic

An O(nlog3 n) algorithm for the real root problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
J. H. Reif ; Dept. of Comput. Sci., Duke Univ., Durham, NC, USA

Given a univariate complex polynomial f(x) of degree n with rational coefficients expressed as a ratio of two integers <2m , the root problem is to find all the roots of f(x) up to specified precision 2. In this paper we assume the arithmetic model for computation. We give an algorithm for the real root problem: where all the roots of the polynomial are real. Our real root algorithm has time cost of O(nlog2 n(log n+log b)), where b=m+μ, thus has time bound O(nlog3 n) even in the case of high precision m+μ⩽nO(1). This is within a small polylog factor of optimality, thus (perhaps surprisingly) upper bounding the arithmetic complexity of our real root problem to nearly the same as basic arithmetic operations on polynomials. We require only π=O(n(μ+m+n)) bits of precision to carry out our computations. The Boolean complexity of our algorithm is a multiplicative factor of M(π)=O(π(log π)loglog π) more

Published in:

Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on

Date of Conference:

3-5 Nov 1993