Flajolet–Martin algorithm ( Cardinality Estimation)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(N)$ == Space Complexity == $O(log n)$ words (https://www.sciencedirect.com/science/article/pii/S0022000097915452) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == Yes, == Model of Computation == Word RAM == Year == 1984 == Reference == http://algo.inria.fr/flajolet/Publications/src/FlMa85.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(N)$

Space Complexity

$O(log n)$ words

(https://www.sciencedirect.com/science/article/pii/S0022000097915452)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

Yes,

Model of Computation

Word RAM

Year

1984

Reference

http://algo.inria.fr/flajolet/Publications/src/FlMa85.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Flajolet–Martin_algorithm_(_Cardinality_Estimation)&oldid=45365"