The Communication Hierarchy of Time and Space Bounded Parallel Machines
From MaRDI portal
The Communication Hierarchy of Time and Space Bounded Parallel Machines
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Hierarchies of computability and definability (03D55) Complexity of computation (including implicit computational complexity) (03D15)
Recommendations
Cites work
- scientific article; zbMATH DE number 4130026 (Why is no real title available?)
- scientific article; zbMATH DE number 1142308 (Why is no real title available?)
- A communication hierarchy of parallel computations
- Alternation
- Communication for alternating machines
- On the power of synchronization in parallel computations
- Some properties of space-bounded synchronized alternating Turing machines with universal states only
Cited in
(2)
This page was built for publication: The Communication Hierarchy of Time and Space Bounded Parallel Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4825478)