Local Decoding and Testing for Homomorphisms
暂无分享,去创建一个
[1] Ran Raz,et al. Sub-constant error low degree test of almost-linear size , 2006, STOC '06.
[2] Luca Trevisan,et al. Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..
[3] Marcos A. Kiwi. Testing and Weight Distributions of Dual Codes , 1997, Electron. Colloquium Comput. Complex..
[4] Marcos A. Kiwi. Algebraic testing and weight distributions of codes , 2003, Theor. Comput. Sci..
[5] Mihir Bellare,et al. Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.
[6] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[7] Eyal Kushilevitz,et al. Learning decision trees using the Fourier spectrum , 1991, STOC '91.
[8] Ronitt Rubinfeld,et al. Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions , 2008, Random Struct. Algorithms.
[9] Venkatesan Guruswami,et al. List decoding algorithms for certain concatenated codes , 2000, STOC '00.
[10] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[11] Avi Wigderson,et al. Derandomizing Homomorphism Testing in General Groups , 2006, SIAM J. Comput..
[12] Ronitt Rubinfeld,et al. Learning polynomials with queries: The highly noisy case , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[13] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma (extended abstract) , 1999, STOC '99.
[14] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[15] Frédéric Magniez,et al. Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey , 2000, Theoretical Aspects of Computer Science.