Khuller; Matias ( Closest Pair Problem)

From Algorithm Wiki

Revision as of 08:32, 10 April 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$, not sure if this is auxiliary not mentioned (https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0890540185710498, Theorem 2.3) == Description == Randomized Sieve == Approximate? == Exact == Randomized? == Yes, Las Vegas == Model of Computation == not mentioned == Year == 1995 == Reference == https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0890540185710498")

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

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n)$, not sure if this is auxiliary not mentioned

(https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0890540185710498, Theorem 2.3)

Description

Randomized Sieve

Approximate?

Exact

Randomized?

Yes, Las Vegas

Model of Computation

not mentioned

Year

1995

Reference

https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0890540185710498

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Khuller;_Matias_(_Closest_Pair_Problem)&oldid=47302"