Parallel computation thesis: Difference between revisions

Browse history interactively

← Previous edit Next edit →

Content deleted Content added

VisualWikitext

Revision as of 19:00, 4 June 2025 edit Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 472,932 edits ce ← Previous edit		Revision as of 10:44, 24 June 2025 edit undo OAbot (talk \| contribs) Bots 643,717 edits m Open access bot: url-access=subscription updated in citation with #oabot. Next edit →
(One intermediate revision by one other user not shown)
Line 30: === Extended parallel computation thesis === The '''extended parallel computation thesis'''<ref>{{Cite ~~journal~~book \|last1=Dymond \|first1=Patrick W. \|last2=Cook \|first2=Stephen A. \|title=21st Annual Symposium on Foundations of Computer Science (SFCS 1980) \|chapter=Hardware complexity and parallel computation \|date=October 1980 \|chapter-url=https://ieeexplore.ieee.org/document/4567837 \|pages=360–372 \|doi=10.1109/SFCS.1980.22}}</ref> states that both of these are true: * Turing machine (head reversal, tape space) and PRAM (parallel time, processor count) are simultaneously polynomially related. Line 46: == Further reading == * {{Citation \|last1=Balcázar \|first1=José Luis \|title=The Parallel Computation Thesis \|date=1990 \|work=Structural Complexity II \|pages=33–62 \|editor-last=Balcázar \|editor-first=José Luis \|url=https://link.springer.com/chapter/10.1007/978-3-642-75357-2_3 \|access-date=2025-05-19 \|place=Berlin, Heidelberg \|publisher=Springer \|language=en \|doi=10.1007/978-3-642-75357-2_3 \|isbn=978-3-642-75357-2 \|last2=Díaz \|first2=Josep \|last3=Gabarró \|first3=Joaquim \|editor2-last=Díaz \|editor2-first=Josep \|editor3-last=Gabarró \|editor3-first=Joaquim\|url-access=subscription }} [[Category:Parallel computing]]