Almost k-wise independence versus k-wise independence

被引:30
|
作者
Alon, N
Goldreich, O [1 ]
Mansour, Y
机构
[1] Weizmann Inst Sci, Dept Comp Sci, IL-76100 Rehovot, Israel
[2] Tel Aviv Univ, Sackler Fac Exact Sci, Ramat Aviv, Israel
[3] Tel Aviv Univ, Sch Comp Sci, Ramat Aviv, Israel
关键词
combinatorial problems; theory of computation; small probability spaces; k-wise independent distributions; almost k-wise independent distributions; small-bias probability spaces;
D O I
10.1016/S0020-0190(03)00359-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We say that a distribution over {0,1}(n) is (epsilon,k)-wise independent if its restriction to every k coordinates results in a distribution that is epsilon-close to the uniform distribution. A natural question regarding (epsilon, k)-wise independent distributions is how close they are to some k-wise independent distribution. We show that there exist (epsilon,k)-wise independent distributions whose statistical distance is at least n(O(k).)epsilon from any k-wise independent distribution. In addition, we show that for any (epsilon,k)-wise independent distribution there exists some k-wise independent distribution, whose statistical distance is n(O(k).)epsilon. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:107 / 110
页数:4
相关论文
共 50 条
  • [1] Testing k-wise and Almost k-wise Independence
    Alon, Noga
    Andoni, Alexandr
    Kaufman, Tali
    Matulef, Kevin
    Rubinfeld, Ronitt
    Xie, Ning
    [J]. STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 496 - 505
  • [2] Almost k-wise independence and hard Boolean functions
    Kabanets, V
    [J]. THEORETICAL COMPUTER SCIENCE, 2003, 297 (1-3) : 281 - 295
  • [3] Almost k-wise independence and hard Boolean functions
    Kabanets, V
    [J]. LATIN 2000: THEORETICAL INFORMATICS, 2000, 1776 : 197 - 206
  • [4] On k-wise set-intersections and k-wise hamming-distances
    Grolmusz, V
    Sudakov, B
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2002, 99 (01) : 180 - 190
  • [5] Derandomized Constructions of k-Wise (Almost) Independent Permutations
    Eyal Kaplan
    Moni Naor
    Omer Reingold
    [J]. Algorithmica, 2009, 55 : 113 - 133
  • [6] Derandomized Constructions of k-Wise (Almost) Independent Permutations
    Kaplan, Eyal
    Naor, Moni
    Reingold, Omer
    [J]. ALGORITHMICA, 2009, 55 (01) : 113 - 133
  • [7] Derandomized constructions of k-wise (almost) independent permutations
    Kaplan, E
    Naor, M
    Reingold, O
    [J]. APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2005, 3624 : 354 - 365
  • [8] A Note on k-Wise Oddtown Problems
    O'Neill, Jason
    Verstraete, Jacques
    [J]. GRAPHS AND COMBINATORICS, 2022, 38 (03)
  • [9] Robust characterizations of k-wise independence over product spaces and related testing results
    Rubinfeld, Ronitt
    Xie, Ning
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2013, 43 (03) : 265 - 312
  • [10] k-Wise Independent Random Graphs
    Alon, Noga
    Nussboim, Asaf
    [J]. PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 813 - +