Factoring Rational Polynomials Over the Complex Numbers

NC algorithms are given for determining the number and degrees of the factors, irreducible over the complex numbers ${\bf C}$, of a multivariate polynomial with rational coefficients and for approximating each irreducible factor. NC is the class of functions computable by logspace-uniform boolean circuits of polynomial size and polylogarithmic depth. The measures of size of the input polynomial are its degree, coefficient length, number of variables (d, c, and n, respectively). If n is fixed, we give a deterministic NC algorithm. If the number of variables is not fixed, we give a random (Monte-Carlo) NC algorithm in these input measures to find the number and degree of each irreducible factor.After reducing to the two-variable, square-free case, we apply the classical algebraic geometry fact that the absolute irreducible factors of $(P(z_1 ,z_2 ) = 0)$ correspond to the connected components of the real surface (or complex curve) $P(z_1 ,z_2 ) = 0$ minus its singular points. In finding the number of connec...

[1]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..

[2]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[3]  Erich Kaltofen,et al.  Effective Noether irreducibility forms and applications , 1991, STOC '91.

[4]  S. Comput,et al.  POLYNOMIAL-TIME REDUCTIONS FROM MULTIVARIATE TO BI- AND UNIVARIATE INTEGRAL POLYNOMIAL FACTORIZATION* , 1985 .

[5]  James H. Davenport,et al.  Factorization over finitely generated fields , 1981, SYMSAC '81.

[6]  Keith Kendig.  Elementary algebraic geometry , 1976 .

[7]  John F. Canny,et al.  A new algebraic method for robot motion planning and real geometry , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[8]  P. G. Ciarlet,et al.  Introduction to Numerical Linear Algebra and Optimisation , 1989 .

[9]  Allan Borodin,et al.  Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10]  C. Andrew Neff,et al.  Specified precision polynomial root isolation is in NC , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[11]  D. Mumford.  Algebraic Geometry I: Complex Projective Varieties , 1981 .

[12]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[13]  Joos Heintz,et al.  Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables , 1981, ICALP.

[14]  Joachim von zur Gathen,et al.  Irreducibility of Multivariate Polynomials , 1985, J. Comput. Syst. Sci..

[15]  Roberto Dvornicich,et al.  Newton Symmetric Functions and the Arithmetic of Algebraically Closed Fields , 1987, AAECC.

[16]  Erich Kaltofen,et al.  Fast Parallel Absolute Irreducibility Testing , 1985, J. Symb. Comput..

[17]  Dominique Duval,et al.  Computations on Curves , 1984, EUROSAM.

[18]  Nathan Jacobson.  Ein algebraisches Kriterium für absolute Irreduzibilität , 1983 .

[19]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[20]  Joe W. Harris,et al.  Principles of Algebraic Geometry , 1978 .

[21]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .