COCO 1994 Annual IEEE Conference on Computational Complexity
 |  |
Wall of Fame | Most Viewed COCO-1994 Paper
COCO
1994
Springer
13 years 8 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
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 |  | 140 | ||
| 2 | | 108 | ||
| 3 | | 102 | ||
| 4 | | 100 | ||
| 5 | | 90 | ||
| 6 | | 89 | ||
| 7 | | 86 | ||
| 8 | | 82 |