zbMATH — the first resource for mathematics

Computing multivariate polynomials in parallel. (English) Zbl 0489.68036

68Q25 Analysis of algorithms and problem complexity
PDF BibTeX Cite
Full Text: DOI
[1] Borodin, A.; Munro, I., The computational complexity of algebraic and numeric problems, (1975), American Elsevier New York · Zbl 0404.68049
[2] Csanky, L., Fast parallel matrix inversion, SIAM J. comput., 5, 4, 618-623, (1976) · Zbl 0353.68063
[3] Hyafil, L., On the parallel evaluation of multivariate polynomials, SIAM J. comput., 3, 2, 120-123, (1979) · Zbl 0408.68041
[4] Strassen, V., Vermeidung von divisionen, J. reine angew. math., 264, 184-202, (1973) · Zbl 0294.65021
[5] L. Valiant, Completeness classes in algebra, Proc. 11th ACM Symposium on Theory of Computing, Atlanta, GA, April 30-May 2 (1972) 249-261
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.