Dyer (2-dimensional array representation Closest Pair Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n)$ using $O(n^{2})$ processors
Space Complexity
$O(n^{2})$ words
(https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0020019080900356)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
log-space pyramid cellular automaton
Year
1980
Reference
https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0020019080900356