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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	SIAM journal on computing Ročník 22; číslo 2; s. 318 - 331
Hlavní autori:	Bajaj, Chanderjit, Canny, John, Garrity, Thomas, Warren, Joe
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.04.1993
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!