Parallel random access machines with powerful instruction sets
- 1 December 1981
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 15 (1) , 191-210
- https://doi.org/10.1007/bf01786979
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- AlternationJournal of the ACM, 1981
- Time Bounded Random Access Machines with Parallel ProcessingJournal of the ACM, 1979
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- Parallel and nondeterministic time complexity classesPublished by Springer Nature ,1978
- A unified approach to models of synchronous parallel machinesPublished by Association for Computing Machinery (ACM) ,1978
- Recursive turing machines †International Journal of Computer Mathematics, 1977
- On the power of multiplication in random access machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- Computational complexity of random access stored program machinesTheory of Computing Systems, 1971
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971