Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators

Algorithms are developed that adopt a novel implicit representation for multivariate polynomials and rational functions with rational coefficients, that of black boxes for their evaluation. It is shown that within this evaluation-box representation, the polynomial greatest common divisor and factorization problems as well as the problem of extracting the numerator and denominator of a rational function can be solved in random polynomial time in the usual parameters. Since the resulting evaluation programs for the goal polynomials can be converted efficiently to sparse format, solutions to sparse problems such as the sparse ration interpolation problem follow as a consequence.<<ETX>>

[1]  Erich Kaltofen,et al.  Factoring Sparse Multivariate Polynomials , 1983, J. Comput. Syst. Sci..

[2]  F. S. Macaulay,et al.  The Algebraic Theory of Modular Systems , 1972 .

[3]  Erich Kaltofen,et al.  Dagwood: a system for manipulating polynomials given by straight-line programs , 1988, TOMS.

[4]  Douglas H. Wiedemann.  Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[5]  Erich Kaltofen,et al.  Solving systems of nonlinear polynomial equations faster , 1989, ISSAC '89.

[6]  Erich Kaltofen.  Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials , 1987, STOC '87.

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

[8]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[9]  Barry M. Trager,et al.  Algebraic factoring and rational function integration , 1976, SYMSAC '76.

[10]  Erich Kaltofen.  Effective Hilbert Irreducibility , 1985, Inf. Control..

[11]  Joachim von zur Gathen,et al.  Parallel algorithms for algebraic problems , 1983, SIAM J. Comput..

[12]  Erich Kaltofen,et al.  Uniform closure properties of P-computable functions , 1986, STOC '86.

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

[14]  J. von zur Gathen.  Factoring sparse multivariate polynomials , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[15]  Walter Baur,et al.  The Complexity of Partial Derivatives , 1983, Theor. Comput. Sci..

[16]  Joachim von zur Gathen.  Representations and Parallel Computations for Rational Functions , 1986, SIAM J. Comput..

[17]  Erich Kaltofen,et al.  Greatest common divisors of polynomials given by straight-line programs , 1988, JACM.

[18]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[19]  Joachim von zur Gathen.  Parallel algorithms for algebraic problems , 1983, STOC '83.

[20]  Erich Kaltofen,et al.  Improved Sparse Multivariate Polynomial Interpolation Algorithms , 1988, ISSAC.

[21]  Marek Karpinski,et al.  Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..

[22]  Michael Ben-Or,et al.  A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.