Parallelism Always Helps
DOI10.1137/S0097539794265402zbMATH Open0868.68055OpenAlexW2060712743MaRDI QIDQ4337438FDOQ4337438
Authors: Louis Mak
Publication date: 19 May 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539794265402
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Cited In (9)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Imperative process algebra and models of parallel computation
- Multiplication, division, and shift instructions in parallel random access machines
- On saving space in parallel computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallelizing time with polynomial circuits
This page was built for publication: Parallelism Always Helps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337438)