ECCC-Report TR11-045https://eccc.weizmann.ac.il/report/2011/045Comments and Revisions published for TR11-045en-usMon, 02 Jul 2012 18:05:11 +0300
Revision 1
| Property Testing Lower Bounds via Communication Complexity |
Eric Blais,
Joshua Brody,
Kevin Matulef
https://eccc.weizmann.ac.il/report/2011/045#revision1We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for reducing communication problems to testing problems, thus allowing us to use known lower bounds in communication complexity to prove lower bounds in testing. This scheme is general and implies a number of new testing bounds, as well as simpler proofs of several known bounds.
For the problem of testing whether a boolean function is $k$-linear (a parity function on $k$ variables), we achieve a lower bound of $\Omega(k)$ queries, even for adaptive algorithms with two-sided error, thus confirming a conjecture of Goldreich (2010). The same argument behind this lower bound also implies a new proof of known lower bounds for testing related classes such as $k$-juntas. For some classes, such as the class of monotone functions and the class of $s$-sparse GF(2) polynomials, we significantly strengthen the best known bounds.
Mon, 02 Jul 2012 18:05:11 +0300https://eccc.weizmann.ac.il/report/2011/045#revision1
Paper TR11-045
| Property Testing Lower Bounds via Communication Complexity |
Eric Blais,
Joshua Brody,
Kevin Matulef
https://eccc.weizmann.ac.il/report/2011/045We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for reducing communication problems to testing problems, thus allowing us to use known lower bounds in communication complexity to prove lower bounds in testing. This scheme is general and implies a number of new testing bounds, as well as simpler proofs of several known bounds.
For the problem of testing whether a boolean function is $k$-linear (a parity function on $k$ variables), we achieve a lower bound of $\Omega(k)$ queries, even for adaptive algorithms with two-sided error, thus confirming a conjecture of Goldreich (2010). The same argument behind this lower bound also implies a new proof of known lower bounds for testing related classes such as $k$-juntas. For some classes, such as the class of monotone functions and the class of $s$-sparse GF(2) polynomials, we significantly strengthen the best known bounds.
Fri, 01 Apr 2011 20:26:09 +0300https://eccc.weizmann.ac.il/report/2011/045