Parallelism Always Helps

DOI10.1137/S0097539794265402MaRDI QIDQ4337438zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

random-access machine

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 4051005
• scientific article; zbMATH DE number 3954278
• Parallelism in random access machines
• Parallelizing time with polynomial circuits
• Simulation of Parallel Random Access Machines by Circuits

Cited in

(9)

• scientific article; zbMATH DE number 3954278 (Why is no real title available?)
• scientific article; zbMATH DE number 1304267 (Why is no real title available?)
• scientific article; zbMATH DE number 4051005 (Why is no real title available?)
• Imperative process algebra and models of parallel computation
• Multiplication, division, and shift instructions in parallel random access machines
• On saving space in parallel computation
• scientific article; zbMATH DE number 3982517 (Why is no real title available?)
• scientific article; zbMATH DE number 2086677 (Why is no real title available?)
• 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)