Fast parallel computation of polynomials using few processors
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 132-139
- https://doi.org/10.1007/3-540-10856-4_79
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A complexity theory based on Boolean algebraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- On uniform circuit complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Completeness classes in algebraPublished by Association for Computing Machinery (ACM) ,1979
- Deterministic CFL's are accepted simultaneously in polynomial time and log squared spacePublished by Association for Computing Machinery (ACM) ,1979
- On the parallel evaluation of multivariate polynomialsPublished by Association for Computing Machinery (ACM) ,1978
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976