Parallel Computation Thesis Computational (1 results)

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computationalcomplexity theory, the parallel computation thesis is a hypothesis whichstates that the time used by a (reasonable) parallel machine ispolynomially related to the space used by a sequential machine. Theparallel computation thesis was set forth by Chandra and Stockmeyer in1976 (see References).In other words, for a computational model whichallows computations to branch and run in parallel without bound, aformal language which is decidable under the model using no more thant(n) steps for inputs of length n is decidable by a machine in theunbranching model using no more than t(n)k units of storage for someconstant k. Similarly, if a machine in the unbranching model decides alanguage using no more than s(n) storage, a machine in the parallelmodel can decide the language in no more than s(n)k steps for someconstant k.…