Joachim von zur Gathen
ABSTRACT
In Borodin-von zur Gathen-Hopcroft[82] the following program is laid out: obtain a “theory package for parallel algebraic computations”, i.e. fast parallel computations for the widely used problems of symbolic manipulation in an algebraic context. In that paper, two basic problems were considered: solving systems of linear equations and computing the gcd of two polynomials, both over arbitrary ground fields.
The present paper continues this program, and fast parallel solutions to the following algebraic problems are given: computing all entries of the Extended Euclidean Scheme of two polynomials over an arbitrary field, gcd and lcm of many polynomials, factoring polynomials over finite fields, and the squarefree decomposition of polynomials over fields of characteristic zero and over finite fields.
- 1.Berlekamp, E. R., Factoring polynomials over large finite fields, Math. Comp., 24(1970), 713-735.Google Scholar
Cross Ref
- 2.Borodin, A., von zur Gathen, J. and Hopcroft, J., Fast parallel matrix and gcd computations, Proc. 23rd Annual Symp. FOCS, Chicago 1982, 65-71. To appear in Information and Control.Google ScholarCross Ref
- 3.Brown, W.S., On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, J. ACM 18(1971), 478-504. Google ScholarDigital Library
- 4.Brown, W.S., and Traub, J.F., On Euclid's Algorithm and the Theory of Subresultants, J. ACM 18(1971), 505-514. Google ScholarDigital Library
- 5.Cantor, D.G., and Zassenhaus, H., On algorithms for factoring polynomials over finite fields, Math. Comp. 36(1981), 587-592.Google ScholarCross Ref
- 6.Collins, G.E., Subresultants and Reduced Polynomial Remainder Sequences, J. ACM 14(1967), 128-142. Google ScholarDigital Library
- 7.Edmonds, J., Systems of Distinct Representatives and Linear Algebra, J. of Res. Nat. Bureau of Standards, 71B(1967), 241-245.Google ScholarCross Ref
- 8.von zur Gathen, J., Representations of rational functions, in preparation, November 1982.Google Scholar
- 9.Kaltofen, E., A polynomial-time reduction from bivariate to univariate integral polynomial factorization, Proc. 23rd Annual Symp. FOCS, Chicago 1982, 57-64.Google ScholarDigital Library
- 10.Kaltofen, E. and J. von zur Gathen, A polynomial-time factorization algorithm for multivariate polynomials of finite fields, manuscript, November 1982.Google Scholar
- 11.Knuth, D.E., The Art of Computer Programming, Vol.2, 2nd Ed., Addison-Wesley 1981. Google ScholarDigital Library
- 12.Lenstra, A.K., Lenstra, H.W., and Lovász, L., Factoring polynomials with rational coefficients, preprint, Stichting Mathematisch Centrum, Amsterdam, 1982.Google Scholar
- 13.Valiant, L.G., Reducibility by algebraic projections, in: Logic and Algorithmic, Zürich 1980, Monographie No. 30, Enseignement Mathématique, 365-380.Google Scholar
Index Terms
- Parallel algorithms for algebraic problems
Recommendations
Inequalities of Rafalson type for algebraic polynomials
For a positive Borel measure dµ, we prove that the constant γn(dv;dµ) = supπ∈Jn\{0} ∫-xx π2(x)dv(x)/∫-xx π2(x)dµ(x)' can be represented by the zeros of orthogonal polynomials corresponding to dµ in case (i) dv(x)=(A+Bx)dµ(x), where A+Bx is nonnegative ...
On Dynamic Algorithms for Algebraic Problems
In this paper, we examine the problem of incrementally evaluating algebraic functions. In particular, iff(x1,x2, ,xn)=(y1,y2, ,ym) is an algebraic problem, we consider answering on-line requests of the form “change inputxito valuev” or “what is the ...
Comments