Dyer (2-dimensional array representation Closest Pair Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:3710:37, 15 February 2023‎ Admin talk contribs‎ 432 bytes +432‎ 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"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Dyer_(2-dimensional_array_representation_Closest_Pair_Problem)"