COCO 1991 Annual IEEE Conference on Computational Complexity
 |  |
Wall of Fame | Most Viewed COCO-1991 Paper
COCO
1991
Springer
14 years 3 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 173 | ||
| 2 | | 130 | ||
| 3 | | 112 | ||
| 4 | | 93 |