The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ (Q3802607): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q919821 |
||
| Property / author | |||
| Property / author: Prabhakar Ragde / rank | |||
Revision as of 14:08, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ |
scientific article |
Statements
The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ (English)
0 references
1988
0 references
parallel random access machines
0 references
element distinctness
0 references
lower bound
0 references
PRAM
0 references
model of parallel computation
0 references
