|
Zapiski Nauchnykh Seminarov POMI, 2001, Volume 277, Pages 104–116
(Mi znsl1431)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
A polynomial lower bound for the size of any $k$-min-wise independent set of permutations
S. A. Norin Saint-Petersburg State University
Abstract:
The notion of $k$-min-wise independent set of permutations, which was introduced by A. Broder et al., is considered. A nontrivial polynomial lower bound for the smallest size of such sets is obtained.
Received: 01.10.2001
Citation:
S. A. Norin, “A polynomial lower bound for the size of any $k$-min-wise independent set of permutations”, Computational complexity theory. Part VI, Zap. Nauchn. Sem. POMI, 277, POMI, St. Petersburg, 2001, 104–116; J. Math. Sci. (N. Y.), 118:2 (2003), 4994–5000
Linking options:
https://www.mathnet.ru/eng/znsl1431 https://www.mathnet.ru/eng/znsl/v277/p104
|
Statistics & downloads: |
Abstract page: | 252 | Full-text PDF : | 70 |
|