COCO 1998 Annual IEEE Conference on Computational Complexity
 |  |
Wall of Fame | Most Viewed COCO-1998 Paper
COCO
1998
Springer
14 years 5 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, 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 |  | 123 | ||
| 2 | | 109 | ||
| 3 | | 103 | ||
| 4 | | 100 | ||
| 5 | | 98 | ||
| 6 | | 95 | ||
| 7 | | 93 | ||
| 8 | | 86 |