Testing Fourier Dimensionality and Sparsity
暂无分享,去创建一个
Rocco A. Servedio | Parikshit Gopalan | Ryan O'Donnell | Amir Shpilka | Karl Wimmer | R. O'Donnell | R. Servedio | Amir Shpilka | K. Wimmer | Parikshit Gopalan
[1] Nathan Linial,et al. Random Vectors of Bounded Weight and Their Linear Dependencies , 2000 .
[2] Noga Alon,et al. Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.
[3] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1993, JACM.
[4] Subhash Khot,et al. Hardness of Reconstructing Multivariate Polynomials over Finite Fields , 2007, FOCS.
[5] Guy Kindler,et al. Testing juntas , 2002, J. Comput. Syst. Sci..
[6] Eric Blais. Testing juntas nearly optimally , 2009, STOC '09.
[7] Noga Alon,et al. Every monotone graph property is testable , 2005, STOC '05.
[8] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[9] H. Buhrman,et al. Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..
[10] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[11] Terence Tao,et al. Testability and repair of hereditary hypergraph properties , 2008, Random Struct. Algorithms.
[12] Jeffrey C. Jackson,et al. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[13] Rocco A. Servedio,et al. Testing for Concise Representations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[14] Noga Alon,et al. A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.
[15] L. Fortnow,et al. Quantum property testing , 2002, SODA '03.
[16] E. Fischer. THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .
[17] Eric Blais. Improved Bounds for Testing Juntas , 2008, APPROX-RANDOM.
[18] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..
[19] Noga Alon,et al. A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[20] Mihir Bellare,et al. Linearity testing in characteristic two , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[21] Bruno Codenotti,et al. Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem , 1999, IEEE Trans. Computers.
[22] Eyal Kushilevitz,et al. Learning decision trees using the Fourier spectrum , 1991, STOC '91.
[23] Madhu Sudan,et al. Sparse Random Linear Codes are Locally Decodable and Testable , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[24] Rocco A. Servedio,et al. Testing Halfspaces , 2007, SIAM J. Comput..
[25] Alex Samorodnitsky,et al. Low-degree tests at large distances , 2006, STOC '07.
[26] Noga Alon,et al. Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.
[27] Ryan O'Donnell,et al. Testing Fourier Dimensionality and Sparsity , 2009, ICALP.
[28] Dana Ron,et al. Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..
[29] Vitaly Feldman,et al. New Results for Learning Noisy Parities and Halfspaces , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).