Skip to search formSkip to main contentSkip to account menu

Parallel computation thesis

In computational complexity theory, the parallel computation thesis is a hypothesis which states that the time used by a (reasonable) parallel… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Alternating Turing machineComputational complexity theoryComputational modelFormal language

Broader (2)

Parallel computingTheory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Playing Savitch and Cooking Games
  • P. Boas
  • Concurrency, Compositionality, and Correctness
  • 2010
  • Corpus ID: 30521675
The complexity class PSPACE is one of the most robust concepts in contemporary computer science. Aside from the fact that space… 
2002
2002
Introduction to the Complexity of Parallel Algorithms
We present an introduction to the general theory of complexity of parallel algorithms. We first recall the main results of… 
1998
1998
Time-Space Trade-Offs in Parallel and Neural Computing
To which extend can we speak about time-space tradeoffs in the sense that, for a given problem, a faster algorithm requires more… 
1990
1990
The Parallel Computation Thesis
We shall study in this chapter the relation between sequential and parallel computations. To this we consider in detail other… 
1989
1989
A Note on Nondeterminism in Small, Fast Parallel Computers
Nondeterministic analogues of the well-known language classes NC and SC called NNC and NSC, respectively, are investigated. NC is… 
1983
1983
A Note on the 'Parallel Computation Thesis'
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)