A fast parallel algorithm for determining all roots of a polynomial with real roots

Authors:
M Ben-Or;E Feig;D Kozen;P Tiwari
Affiliations:
Hebrew University, Jerusalem, Israel;IBM Research, Yorktown Heights, NY;Dept. of Computer Science, Cornell University, Ithaca, NY;Coordinated Science Lab., University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Year:
1986

On computing the determinant in small parallel time using a small number of processors

Information Processing Letters
Applied and computational complex analysis. Vol. 3: discrete Fourier analysis—Cauchy integrals—construction of conformal maps---univalent functions

Applied and computational complex analysis. Vol. 3: discrete Fourier analysis—Cauchy integrals—construction of conformal maps---univalent functions
Subresultants and Reduced Polynomial Remainder Sequences

Journal of the ACM (JACM)
Integer Arithmetic Algorithms for Polynomial Real Zero Determination

Journal of the ACM (JACM)
Parallelism in random access machines

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of elementary algebra and geometry

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Parallel algorithms for algebraic problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Hi-index	0.00