Hyperloglog, Probability, Hash Function, Cardinality Estimation, Dynamic Programming.
the number of hash functions. import math # Function to generate all possible combinations of k1, k2, ..., km def hn(N, m, curr, out): if m == 0: out += [curr] else: for k in range(N+1): hn(N, m-1, curr + [k], out) N = 10 n = 1 << N for m in range(1, 10): s1, s2 = 0, 0 out = [] hn(N, m, [], out) #