Time Complexity of Boolean Functions on CREW PRAM<scp>s</scp>
From MaRDI portal
Publication:3358235
DOI10.1137/0220051zbMath0732.68053OpenAlexW2094693960MaRDI QIDQ3358235
Publication date: 1991
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220051
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (5)
Exact lower time bounds for computing Boolean functions on CREW PRAMs ⋮ An insight on PRAM computational bounds ⋮ Retrieval of scattered information by EREW, CREW, and CRCW PRAMs ⋮ Separating the power of EREW and CREW PRAMs with small communication width ⋮ Separating the power of EREW and CREW PRAMs with small communication width
This page was built for publication: Time Complexity of Boolean Functions on CREW PRAM<scp>s</scp>
