Parallel random access machines with powerful instruction sets

DOI10.1007/BF01786979MaRDI QIDQ3959429zbMATH OpenFDO

Authors Walter Savitch

Publication date 1982

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

Full work available at URL https://doi.org/10.1007/BF01786979

zbMATH Keywords

NPparallel processingPSPACEstring manipulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• A characterization of the power of vector machines
• A unified approach to models of synchronous parallel machines
• Alternation
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Computational complexity of random access stored program machines
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Parallelism in random access machines
• Recursive turing machines †
• Time bounded random access machines
• Time Bounded Random Access Machines with Parallel Processing

Cited in

(2)

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

This page was built for publication: Parallel random access machines with powerful instruction sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3959429)