Rabin' Algorithm (k-dimensional space, l m (or l infty) norm Closest Pair Problem)

From Algorithm Wiki

Revision as of 11:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({3}^k*n^{2})$ == Space Complexity == $O(n)$ words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == Yes, Las Vegas == Model of Computation == Real RAM == Year == 1976 == Reference == https://dl.acm.org/citation.cfm?id=540196")

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

Jump to navigation Jump to search

Time Complexity

$O({3}^k*n^{2})$

Space Complexity

$O(n)$ words

(can be easily derived)

Description

Approximate?

Exact

Randomized?

Yes, Las Vegas

Model of Computation

Real RAM

Year

1976

Reference

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Rabin%27_Algorithm_(k-dimensional_space,_l_m_(or_l_infty)_norm_Closest_Pair_Problem)&oldid=44604"