The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ (Q3802607): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:22, 5 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
