A taxonomy of problems with fast parallel algorithms
- 1 January 1985
- journal article
- Published by Elsevier in Information and Control
- Vol. 64 (1-3) , 2-22
- https://doi.org/10.1016/s0019-9958(85)80041-3
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- Parallel computation for well-endowed rings and space-bounded probabilistic machinesInformation and Control, 1983
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- Parallel Matrix and Graph AlgorithmsSIAM Journal on Computing, 1981
- AlternationJournal of the ACM, 1981
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976