Parallel computation for well-endowed rings and space-bounded probabilistic machines
- 30 September 1983
- journal article
- Published by Elsevier in Information and Control
- Vol. 58 (1-3), 113-136
- https://doi.org/10.1016/s0019-9958(83)80060-6
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On tape-bounded probabilistic Turing machine acceptorsTheoretical Computer Science, 1981
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- Deterministic simulation of tape-bounded probabilistic turing machine transducersTheoretical Computer Science, 1980
- Parallel Prefix ComputationJournal of the ACM, 1980
- 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
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- On the Time Required to Perform AdditionJournal of the ACM, 1965
- Signed-Digit Numbe Representations for Fast Parallel ArithmeticIEEE Transactions on Electronic Computers, 1961