Factoring Rational Polynomials over the Complex Numbers

DOI10.1137/0222024zbMath0772.12001OpenAlexW1969594658MaRDI QIDQ4032941

Thomas Garrity, John F. Canny, Chanderjit L. Bajaj, Joe Warren

Publication date: 17 May 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222024

zbMATH Keywords

algorithmsmultivariate polynomialirreducible factorsdeterministic NC algorithmsquarefree polynomial in two variables

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials in real and complex fields: factorization (12D05)

Related Items

Factoring multivariate polynomials via partial differential equations ⋮ Lifting and recombination techniques for absolute factorization ⋮ Numerical factorization of multivariate complex polynomials ⋮ On a generalization of Stickelberger's theorem ⋮ Computing monodromy via continuation methods on random Riemann surfaces ⋮ Improved dense multivariate polynomial factorization algorithms ⋮ Rational solutions of Riccati-like partial differential equations ⋮ Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy ⋮ Linear differential operators for polynomial equations ⋮ Probabilistic absolute irreducibility test for polynomials