Parallel random access machines with bounded memory wordsize
From MaRDI portal
Publication:757038
DOI10.1016/0890-5401(91)90069-EzbMath0723.68041MaRDI QIDQ757038
Publication date: 1991
Published in: Information and Computation (Search for Journal in Brave)
parallel computation; incomparability; parallel random access machines; boolean circuits; hierarchy of machine classes; infinitely many memory cells; wordsize
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Cites Work