Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions
暂无分享,去创建一个
Ronitt Rubinfeld | Michael Ben-Or | Don Coppersmith | Michael Luby | M. Ben-Or | M. Luby | D. Coppersmith | R. Rubinfeld
[1] Avi Wigderson,et al. Derandomizing homomorphism testing in general groups , 2004, STOC '04.
[2] Eli Ben-Sasson,et al. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.
[3] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[4] Avi Wigderson,et al. Simple analysis of graph tests for linearity and PCP , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[5] Luca Trevisan,et al. A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.
[6] Mihir Bellare,et al. Linearity testing in characteristic two , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[7] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[8] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[9] P. Diaconis. Group representations in probability and statistics , 1988 .