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 ci...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on computing Vol. 22; no. 2; pp. 318 - 331
Main Authors:	Bajaj, Chanderjit, Canny, John, Garrity, Thomas, Warren, Joe
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.04.1993
Subjects:	Algebra Algorithms Computer science Exact sciences and technology Field theory and polynomials Geometry Mathematics Polynomials Sciences and techniques of general use Variables Polynomial Critical value N variable function Singular point Factorization Algebraic geometry Complex number
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!