Parallel random access machines with powerful instruction sets

DOI10.1007/BF01786979zbMath0495.68040MaRDI QIDQ3959429

Walter J. Savitch

Publication date: 1982

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

parallel processingPSPACENPstring manipulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Array processing machines: an abstract model, On nondeterminism in parallel computation

Cites Work

• Unnamed Item
• A characterization of the power of vector machines
• Time bounded random access machines
• Alternation
• Recursive turing machines †
• Time Bounded Random Access Machines with Parallel Processing
• A unified approach to models of synchronous parallel machines
• Parallelism in random access machines
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Computational complexity of random access stored program machines