Fast Parallel Computation of Polynomials Using Few Processes

Authors:
Leslie G. Valiant;Sven Skyum
Affiliations:
-;-
Venue:
Proceedings on Mathematical Foundations of Computer Science
Year:
1981

Citing 0
Cited 4

A complexity theory based on Boolean algebra

Journal of the ACM (JACM)
An overview of computational complexity

Communications of the ACM
From randomizing polynomials to parallel algorithms

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
A coarse-grained parallel algorithm for the matrix chain order problem

Proceedings of the 2012 Symposium on High Performance Computing

Quantified Score

Hi-index	0.02

Visualization

Abstract