Fast parallel absolute irreducibility testing
Journal of Symbolic Computation
Applied & computational complex analysis: power series integration conformal mapping location of zero
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables
Proceedings of the 8th Colloquium on Automata, Languages and Programming
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Factorization over finitely generated fields
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Geometric computations with algebraic varieties of bounded degree
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Effective Noether irreducibility forms and applications
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A numerical absolute primality test for bivariate polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A geometric-numeric algorithm for absolute factorization of multivariate polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Differential forms in computational algebraic geometry
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
We give NC algorithms for determining the number and degrees of the absolute factors (factors irreducible over the complex numbers C) of a multi-variate polynomial with rational coefficients. 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 d, coefficient length c, number of variables n, and for sparse polynomials, the number of non-zero coefficients s. For the general case, we give a random (Monte-Carlo) NC algorithm in these input measures. If n is fixed, or if the polynomial is dense, we give a deterministic NC algorithm. The algorithm also works in random NC for polynomials represented by straight-line programs, provided the polynomial can be evaluated at integer points in NC. Finally, we discuss a method for obtaining an approximation to the coefficients of each factor whose running time is polynomial in the size of the original (dense) polynomial. These methods rely on the fact that the connected components of a complex hypersurface P(z1…,zn) = 0 minus its singular points correspond to the absolute factors of P.