The classification of problems which have fast parallel algorithms
- 1 January 1983
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Fast parallel matrix and GCD computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A complexity theory for unbounded fan-in parallelismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Parity, circuits, and the polynomial-time hierarchyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- AlternationJournal of the ACM, 1981
- Hardware complexity and parallel computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- Two theorems on random polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976