Rabin' Algorithm (k-dimensional space, l m (or l infty) norm 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 11:3711:37, 15 February 2023‎ Admin talk contribs‎ 309 bytes +309‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Rabin%27_Algorithm_(k-dimensional_space,_l_m_(or_l_infty)_norm_Closest_Pair_Problem)"