Lower bounds for testing function isomorphism

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2010, Pages 235-246

  Blais, Eric ^a   O'Donnell, Ryan ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Boolean functions; Lower bounds; Property testing

Indexed keywords

INPUT VARIABLES; INVARIANCE PRINCIPLE; LOWER BOUNDS; MAJORITY FUNCTIONS; NONADAPTIVE ALGORITHM; PROPERTY-TESTING; TESTING FUNCTIONS; TOTAL VARIATION;

ADAPTIVE ALGORITHMS; COMPUTATIONAL COMPLEXITY; SET THEORY;

BOOLEAN FUNCTIONS;

EID: 77955252937     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2010.30     Document Type: Conference Paper

References (18)

1. Noga Alon, Eldar Fischer, Ilan Newman, and Asaf Shapira. A combinatorial characterization of the testable graph properties: It's all about regularity. In Proc. of the 38th annual ACM Symposium on the Theory of Computing, pages 251-260, 2006.
2. Noga Alon and Asaf Shapira. A characterization of the (natural) graph properties testable with one-sided error. In Proc. of the 46th IEEE Symposium on Foundations of Computer Science, pages 429-438, 2005.
3. Noga Alon and Asaf Shapira. Every monotone graph property is testable. In Proc. of the 46th IEEE Symposium on Foundations of Computer Science, pages 128-137, 2005.
4. Tim Austin and Terence Tao. On the testability and repair of hereditary hypergraph properties. To appear, Random Struct. Alg.
5. Mihir Bellare, Oded Goldreich, and Madhu Sudan. Free bits, PCPs and non-approximability - towards tight results. SIAM J. Comput., 27(3):804-915, 1998.
6. Eldar Fischer. The difficulty of testing for isomorphism against a graph that is given in advance. SIAM J. Comput., 34(5):1147-1158, 2005.
7. Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, and Alex Samorodnitsky. Testing juntas. J. Comput. Syst. Sci., 68(4):753-787, 2004.
8. Eldar Fischer and Arie Matsliah. Testing graph isomorphism. SIAM J. Comput., 38(1):207-225, 2008.
9. Parikshit Gopalan, Ryan O'Donnell, Yi Wu, and David Zuckerman. Fooling functions of halfspaces under product distributions. In Proc. of the 25th annual IEEE Conference on Computational Complexity, 2010.
10. Thomas Höglund. Sampling from a finite population. A remainder term estimate. Scandinavian Journal of Statistics, 5:69-71, 1978.
11. Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, and Rocco A. Servedio. Testing halfspaces. In SODA '09: Proc. of the 19th Annual ACM -SIAM Symposium on Discrete Algorithms, pages 256-264, 2009.
12. Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, and Rocco A. Servedio. Testing ±1-weight halfspace. In RANDOM '09: Proc. of the 13th Intl. Workshop on Randomization and Computation, pages 646-657, 2009.
13. Elchanan Mossel. Gaussian bounds for noise correlation of functions and tight analysis of long codes. In Proc. of the 49th IEEE Symposium on Foundations of Computer Science, pages 156-165, 2008.
14. Elchanan Mossel, Ryan O'Donnell, and Krzysztof Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. Annals of Mathematics, 171(1):295-341, 2010.
15. Michal Parnas, Dana Ron, and Alex Samorodnitsky. Testing basic boolean formulae. SIAM J. Discrete Math., 16(1):20-46, 2002.
16. Yuval Peres. Noise stability of weighted majority, 2004. http://arxiv.org/abs/math/0412377.
17. Ronitt Rubinfeld and Madhu Sudan. Robust characterizations of polynomials with applications to program testing. SIAM J. Comput., 25(2):252-271, 1996. (Pubitemid 126577271)
18. Andrew Chi-Chih Yao. Probabilistic computations: Toward a unified measure of complexity. In Proc. of the 28th IEEE Symposium on Foundations of Computer Science, pages 222-227, 1977.