Work

Min-wise independent permutations (extended abstract)

Year: 1998

Type: conference-paper

Abstract: 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| .

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/276698.276781

Authors: Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher

Institutions: Stanford University, Carnegie Mellon University

Language: English

Topic: Advanced Combinatorial Mathematics

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, Schlumberger Foundation, Multidisciplinary University Research Initiative, Army Research Office

Awards: Probabilistic Considerations in the Analysis of Algorithms, NYI: The Complexity of Probablistic Algorithms