BOYS algorithm (Entity Resolution Entity Resolution)
Revision as of 08:57, 10 April 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} k)$ == Space Complexity == $O(n^{2})$ words (Derived: As written stores counts/probabailities for all pairs of entries.) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1993 == Reference == https://www.sciencedirect.com/science/article/abs/pii/016794739390116B")
Time Complexity
$O(n^{2} k)$
Space Complexity
$O(n^{2})$ words
(Derived: As written stores counts/probabailities for all pairs of entries.)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1993
Reference
https://www.sciencedirect.com/science/article/abs/pii/016794739390116B