Dyer (2-dimensional array representation Closest Pair Problem)

From Algorithm Wiki

Revision as of 11:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Dyer_(2-dimensional_array_representation_Closest_Pair_Problem)&oldid=44609"