Sciweavers

Share
COCO   2009 Annual IEEE Conference on Computational Complexity
Wall of Fame | Most Viewed COCO-2009 Paper
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
9 years 3 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
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 source155
2Download preprint from source131
3Download preprint from source128
4Download preprint from source128
5Download preprint from source126
6Download preprint from source124
7Download preprint from source124
8Download preprint from source121
9Download preprint from source119
10Download preprint from source117
11Download preprint from source115
12Download preprint from source115
13Download preprint from source113
14Download preprint from source113
15Download preprint from source106
16Download preprint from source106
17Download preprint from source106
18Download preprint from source105
19Download preprint from source99
20Download preprint from source98
21Download preprint from source98
22Download preprint from source96
23Download preprint from source96
24Download preprint from source96
25Download preprint from source96
26Download preprint from source96
27Download preprint from source93
28Download preprint from source78
29Download preprint from source75
books