A fast parallel algorithm for the closest pair problem (Q1145510)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast parallel algorithm for the closest pair problem |
scientific article; zbMATH DE number 3696522
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast parallel algorithm for the closest pair problem |
scientific article; zbMATH DE number 3696522 |
Statements
A fast parallel algorithm for the closest pair problem (English)
0 references
1980
0 references
parallel algorithm
0 references
closest pair problem
0 references
time complexity
0 references
space complexity
0 references
parallel computation
0 references
bounded cellular array automaton
0 references
log- space pyramid cellular automaton
0 references
