Testing Linear-Invariant Non-Linear Properties
暂无分享,去创建一个
[1] Noga Alon,et al. Homomorphisms in Graph Property Testing - A Survey , 2005, Electron. Colloquium Comput. Complex..
[2] B. Green. A Szemerédi-type regularity lemma in abelian groups, with applications , 2003, math/0310476.
[3] Atri Rudra,et al. Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[4] Dana Ron,et al. Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..
[5] László Lovász,et al. Graph limits and parameter testing , 2006, STOC '06.
[6] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[7] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, STOC '08.
[8] 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).
[9] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[10] Noga Alon,et al. Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.
[11] A. Shapira. A proof of Green's conjecture regarding the removal properties of sets of linear equations , 2008, 0807.4901.
[12] Madhu Sudan,et al. Property Testing via Set-Theoretic Operations , 2011, ICS.
[13] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[14] Testing low-degree polynomials over prime fields , 2009 .
[15] Avi Wigderson,et al. Simple analysis of graph tests for linearity and PCP , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[16] Noga Alon,et al. A Characterization of the (Natural) Graph Properties Testable with One-Sided Error , 2008, SIAM J. Comput..
[17] James G. Oxley,et al. Matroid theory , 1992 .
[18] Noga Alon,et al. Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[19] Mihir Bellare,et al. Linearity testing in characteristic two , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[20] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[21] Luca Trevisan,et al. Gowers uniformity, influence of variables, and PCPs , 2005, STOC '06.
[22] Madhu Sudan,et al. Testing Linear-Invariant Non-linear Properties: A Short Report , 2010, Property Testing.
[23] Daniel Král,et al. A combinatorial proof of the Removal Lemma for Groups , 2008, J. Comb. Theory, Ser. A.
[24] Asaf Shapira,et al. A Unified Framework for Testing Linear-Invariant Properties , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[25] Ben Green,et al. Linear equations in primes , 2006, math/0606088.
[26] D. Král,et al. A removal lemma for systems of linear equations over finite fields , 2008, 0809.1846.
[27] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[28] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[29] GoldreichOded,et al. Property testing and its connection to learning and approximation , 1998 .
[30] W. T. Gowers,et al. The true complexity of a system of linear equations , 2007, 0711.0185.
[31] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[32] Arnab Bhattacharyya,et al. Separations of Matroid Freeness Properties , 2010, Electron. Colloquium Comput. Complex..
[33] Madhu Sudan,et al. Testing Linear-Invariant Non-Linear Properties , 2009, STACS.
[34] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[35] Asaf Shapira. Green's conjecture and testing linear-invariant properties , 2009, STOC '09.
[36] Terence Tao,et al. The inverse conjecture for the Gowers norm over finite fields via the correspondence principle , 2008, 0810.5527.
[37] Noga Alon,et al. A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.
[38] Luca Trevisan,et al. A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.
[39] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[40] Noga Alon,et al. Every monotone graph property is testable , 2005, STOC '05.
[41] Dana Ron,et al. Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[42] Noga Alon,et al. Regular Languages are Testable with a Constant Number of Queries , 2000, SIAM J. Comput..
[43] W. T. Tutte. Matroids and graphs , 1959 .