On learning Boolean functions and punctured Reed-Muller-codes
暂无分享,去创建一个
[1] Nader H. Bshouty,et al. Uniform-distribution attribute noise learnability , 2003, Inf. Comput..
[2] Dana Angluin,et al. Learning from noisy examples , 1988, Machine Learning.
[3] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[4] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1993, JACM.
[5] Adam Tauman Kalai,et al. Noise-tolerant learning, the parity problem, and the statistical query model , 2000, STOC '00.
[6] MansourYishay,et al. Constant depth circuits, Fourier transform, and learnability , 1993 .
[7] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[8] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[9] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.
[10] Leslie G. Valiant,et al. A theory of the learnable , 1984, CACM.
[11] R. Gallager. Information Theory and Reliable Communication , 1968 .
[12] Alexander Barg,et al. Random codes: Minimum distances and error exponents , 2002, IEEE Trans. Inf. Theory.