Parallel Computation Thesis: Computational Complexity Theory, Hypothesis, Computational Model - Brossura

Brossura

ISBN 10: 613309589X ISBN 13: 9786133095892

Casa editrice: OmniScriptum, 2026

Riassunto

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational complexity theory, the parallel computation thesis is a hypothesis which states that the time used by a (reasonable) parallel machine is polynomially related to the space used by a sequential machine. The parallel computation thesis was set forth by Chandra and Stockmeyer in 1976 (see References).In other words, for a computational model which allows computations to branch and run in parallel without bound, a formal language which is decidable under the model using no more than t(n) steps for inputs of length n is decidable by a machine in the unbranching model using no more than t(n)k units of storage for some constant k. Similarly, if a machine in the unbranching model decides a language using no more than s(n) storage, a machine in the parallel model can decide the language in no more than s(n)k steps for some constant k.

Dettagli dell'edizione

• Editore: OmniScriptum
• Data di pubblicazione: 2026
• Lingua: Inglese
• ISBN 10: 613309589X
• ISBN 13: 9786133095892
• Rilegatura: Copertina flessibile
• Numero di pagine: 92
• Redattore: Surhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
• Contatto del produttore: non disponibile
• Persona responsabile: non disponibile