Parallelism Always Helps

DOI10.1137/S0097539794265402zbMath0868.68055OpenAlexW2060712743MaRDI QIDQ4337438

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 of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10)

Related Items (1)

Parallelizing time with polynomial circuits

This page was built for publication: Parallelism Always Helps