Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
approach to simulate m different hash functions, is that we take the first p bits from the hash as a bucket. Thus with p bits, we will have 2^p number of buckets. Estimate the cardinality using the remaining N-p bits. Similar to m hash functions, we take the geometric mean of the cardinality in