COCO   2005 Annual IEEE Conference on Computational Complexity
Wall of Fame | Most Viewed COCO-2005 Paper
153views Algorithms» more  COCO 2005»
10 years 9 months ago
Average-Case Computations - Comparing AvgP, HP, and Nearly-P
We examine classes of distributional problems deļ¬ned in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
Arfst Nickelsen, Birgit Schelm
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.
1Download preprint from source153
2Download preprint from source150
3Download preprint from source141
4Download preprint from source131
5Download preprint from source130
6Download preprint from source128
7Download preprint from source124
8Download preprint from source123
9Download preprint from source112
10Download preprint from source110
11Download preprint from source106
12Download preprint from source99
13Download preprint from source98
14Download preprint from source96
15Download preprint from source92
16Download preprint from source89
17Download preprint from source89
18Download preprint from source89
19Download preprint from source80
20Download preprint from source79
21Download preprint from source77
22Download preprint from source75
23Download preprint from source72
24Download preprint from source68