Factoring Rational Polynomials over the Complex Numbers

DOI10.1137/0222024zbMATH Open0772.12001OpenAlexW1969594658MaRDI QIDQ4032941FDOQ4032941

Authors: Thomas Garrity, Chanderjit L. Bajaj, John Canny, J. 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

Recommendations

• Irreducibility of multivariate polynomials
• A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
• Fast parallel absolute irreducibility testing
• Specified precision polynomial root isolation is in NC
• NC algorithms for real algebraic numbers

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)

Cited In (12)

• Numerical factorization of multivariate complex polynomials
• Factoring multivariate polynomials via partial differential equations
• On a generalization of Stickelberger's theorem
• Linear differential operators for polynomial equations
• Rational solutions of Riccati-like partial differential equations
• Probabilistic absolute irreducibility test for polynomials
• Computing monodromy via continuation methods on random Riemann surfaces
• A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
• Lifting and recombination techniques for absolute factorization
• Improved dense multivariate polynomial factorization algorithms
• Title not available (Why is that?)
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy

This page was built for publication: Factoring Rational Polynomials over the Complex Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032941)