Khuller; Matias Randomized Sieve ( Closest Pair Problem)

From Algorithm Wiki
Revision as of 10:35, 15 February 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/science/article/pii/S0890540185710498, Theorem 2.3) == Description == == Approximate? == Exact == Randomized? == Yes, Las Vegas == Model of Computation == not mentioned == Year == 1995 == Reference == https://dl.acm.org/citation.cfm?id=207181")
(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/science/article/pii/S0890540185710498, Theorem 2.3)

Description

Approximate?

Exact

Randomized?

Yes, Las Vegas

Model of Computation

not mentioned

Year

1995

Reference

https://dl.acm.org/citation.cfm?id=207181

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Khuller;_Matias_Randomized_Sieve_(_Closest_Pair_Problem)&oldid=44515"