Non-Abelian homomorphism testing, and distributions close to their self-convolutions

Random Structures and Algorithms

Volumn 32, Issue 1, 2008, Pages 49-70

  Ben or, Michael ^a   Coppersmith, Don ^b   Luby, Mike ^c   Rubinfeld, Ronitt ^d  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b IDA   (United States)

^c Digital Fountain Inc   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Convolutions of distributions; Linearity testing; Sublinear time algorithms

Indexed keywords

EID: 38049108424     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20182     Document Type: Article

References (11)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, JACM 45 (1998), 501-555.
2. M. Bellare, D. Coppersmith, J. Hastad, M. Kiwi, and M. Sudan, Linearity testing in characteristic two, FOCS 1995, IEEE Trans Info Theory 42 (1996), 1782-1795.
3. M. Ben-or, D. Coppersmith, M. Luby, and R. Rubinfeld, "Non-Abelian homomorphism testing, and distributions close to their self-convolutions," In Proceedings of the 8th RANDOM, Cambridge, MA, 2004, LNCS vol. 3122 (2004), pp. 273-285.
4. E. Ben Sasson, M. Sudan, S. Vadhan, and A. Wigderson, "Randomness-efficient low degree tests and short PCP's via Epsilon-biased sets," In Proceedings of the 35th STOC, San Diego, CA, 2003, pp. 612-621.
5. M. Blum, M. Luby, and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, J Comp Sys Sci 47 (1993), 549-595.
6. D. Coppersmith, Personal communication to the authors of [5], (1989).
7. P. Diaconis, "Group representations in probability and statistics," IMS Lecture Notes - Monograph Series Vol. 11, S. Gupta (Editor), Institute of Mathematical Statistics, Hayward, CA, 1988.
8. O. Goldreich and M. Sudan, "Locally testable codes and PCPs of almost-linear length," In Proceedings of 43rd Symposium on FOCS, Vancouver, British Columbia, Canada, 2002, pp. 13-22.
9. J. Hastad and A. Wigderson, Simple analysis of graph tests for linearity and PCP, Random Struct Algorithms 22 (2003), 139-160.
10. A. Samorodnitsky and L. Trevisan, "A PCP characterization of NP with optimal amortized query complexity," In Proceedings of 32nd STOC, Portland, OR, 2000, pp. 191-199.
11. A. Shpilka and A. Wigderson, "Derandomizing homomorphism testing in general groups," In Proceedings of 36th STOC, Chicago, IL, 2004, pp. 427-435.