FAQ

Parallel computation thesis

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

Topic mentions per year

Topic mentions per year

1983-2016
012319832016

Related topics

Related topics

9 relations
Alternating Turing machineComputational complexity theoryComputational modelFormal language
(More)

Broader (2)

Parallel computingTheory of computation

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Parallel computation thesis
Parallel computing
Computational complexity theory
Computational model
Formal language
Turing machine

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
On the parallel computation thesis
We develop a generic programming language for parallel algorithms, one that works for all data structures and control structures… (More)
Is this relevant?
Review
2006
Review
2006
Optical Computing and Computational Complexity
This work concerns the computational complexity of a model of computation that is inspired by optical computers. The model is… (More)
  • figure 1
  • figure 3
  • table 1
Is this relevant?
2005
2005
Lower bounds on the computational power of an optical model of computation
This work is concerned with the computational complexity of a model of computation that is inspired by optical computers. We… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
Computational complexity of an optical model of computation
We investigate the computational complexity of an optically inspired model of computation. The model is called the continuous… (More)
  • figure 2.2
  • figure 2.2
  • table 2.3
  • table 3.2
  • figure 4.2
Is this relevant?
2005
2005
Upper Bounds on the Computational Power of an Optical Model of Computation
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time… (More)
  • figure 1
Is this relevant?
1990
1990
The maximum weight perfect matching problem for complete weighted graphs is in PC
There are efficient sequential algorithms that use linear programming (LP) for computing maximum weight matchings. Pinding a… (More)
Is this relevant?
1989
1989
Complexity Theory of Parallel Time and Hardware
The parallel resources time and hardware and the complexity classes defined by them are studied using the aggregafe model. The… (More)
Is this relevant?
1989
1989
A Note on Nondeterminism in Small, Fast Parallel Computers
Nondeterministic analogues of the well-known classes NC and SC, d d NNC and NSC, respectively, are investigated. Adding… (More)
Is this relevant?
1986
1986
Parallel speedup of sequential machines: a defense of parallel computation thesis
It is reasonable to expect parallel machines to be faster than sequential ones. But exactly how much faster do we expect them to… (More)
Is this relevant?
1983
1983
A Note on the 'Parallel Computation Thesis'
Among others, Borodin [l], Chandra and Stockmeyer [3] and Goldschlager [6] mention that there is evidence that parallel time and… (More)
Is this relevant?