Min-wise independent permutations (extended abstract) 论文
1998引用 357
Complexity and Algorithms in GraphsAlgorithms and Data Compressiongraph theory and CDMA systems
摘要
We define and study the notion of min-wise independent families of permutations. We say that F S n is min-wise independent if for any set X [n] and any x X, when is chosen at random in F we have Pr min{(X)} = (x) = 1 |X| .