Sciweavers

Share
STOC   2000 Annual ACM Symposium on Theory of Computing
Wall of Fame | Most Viewed STOC-2000 Paper
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
12 years 2 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classiļ¬cation noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source174
2Download preprint from source156
3Download preprint from source137
4Download preprint from source137
5Download preprint from source136
6Download preprint from source134
7Download preprint from source123
8Download preprint from source122
9Download preprint from source117
10Download preprint from source112
11Download preprint from source105
12Download preprint from source102
13Download preprint from source97
14Download preprint from source96
15Download preprint from source95
16Download preprint from source83
17Download preprint from source81
18Download preprint from source77
19Download preprint from source73
20Download preprint from source69
21Download preprint from source66
22Download preprint from source55
books