Robust characterizations of k-wise independence over product spaces and related testing results
暂无分享,去创建一个
[1] C. Neuman,et al. Discrete (Legendre) orthogonal polynomials—a survey , 1974 .
[2] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[3] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[4] O. Svensson,et al. Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling , 2007, FOCS 2007.
[5] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[6] Richard M. Karp,et al. A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.
[7] Hanno Lefmann,et al. MODp-tests, almost independence and small probability spaces , 2000, Random Struct. Algorithms.
[8] Ronitt Rubinfeld,et al. Testing that distributions are close , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[9] E. Fischer. THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .
[10] Ronitt Rubinfeld,et al. Sublinear algorithms for testing monotone and unimodal distributions , 2004, STOC '04.
[11] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[12] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[13] Seshadhri Comandur,et al. Testing Expansion in Bounded Degree Graphs , 2007, Electron. Colloquium Comput. Complex..
[14] Moses Charikar,et al. On the Advantage over Random for Maximum Acyclic Subgraph , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[15] Eric Blais. Testing juntas nearly optimally , 2009, STOC '09.
[16] Ronitt Rubinfeld,et al. Algorithms column: sublinear time algorithms , 2003, SIGA.
[17] Ronald de Wolf,et al. A Brief Introduction to Fourier Analysis on the Boolean Cube , 2008, Theory Comput..
[18] Vince Grolmusz,et al. Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs , 2000, Comb..
[19] Noga Alon,et al. Almost k-wise independence versus k-wise independence , 2003, Information Processing Letters.
[20] Rocco A. Servedio,et al. Testing for Concise Representations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[21] Nimrod Megiddo,et al. Constructing small sample spaces satisfying given constraints , 1993, SIAM J. Discret. Math..
[22] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.
[23] Hanno Lefmann,et al. MOD p -tests, almost independence and small probability spaces , 2000 .
[24] Dana Ron,et al. Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[25] H. Smith. I. On systems of linear indeterminate equations and congruences , 1862, Proceedings of the Royal Society of London.
[26] J. Silvester. Determinants of block matrices , 2000, The Mathematical Gazette.
[27] A. Terras. Fourier Analysis on Finite Groups and Applications: Index , 1999 .
[28] Elchanan Mossel,et al. Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[29] Michael Luby. Removing randomness in parallel computation without a processor penalty , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[30] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[31] Noam Nisan,et al. Efficient approximation of product distributions , 1998, Random Struct. Algorithms.
[32] Klim Efremenko,et al. 3-Query Locally Decodable Codes of Subexponential Length , 2008 .
[33] Y. Mansour,et al. On construction of k-wise independent random variables , 1994, STOC '94.
[34] SahaiAmit,et al. A complete problem for statistical zero knowledge , 2003 .
[35] A. Joffe. On a Set of Almost Deterministic $k$-Independent Random Variables , 1974 .
[36] V. B. Uvarov,et al. Classical Orthogonal Polynomials of a Discrete Variable , 1991 .
[37] Yossi Azar,et al. Approximating Probability Distributions Using Small Sample Spaces , 1998, Comb..
[38] Ronitt Rubinfeld,et al. Testing random variables for independence and identity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[39] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[40] Noga Alon,et al. Testing k-wise and almost k-wise independence , 2007, STOC '07.
[41] Ronitt Rubinfeld,et al. Sublinear Time Algorithms , 2011, SIAM J. Discret. Math..
[42] Oded Goldreich,et al. On the power of two-point based sampling , 1989, J. Complex..
[43] Vladimiro Sassone,et al. Bulletin of the European Association for Theoretical Computer Science , 2005 .