RANDOM 1997 International Workshop on Randomization and Approximation Techniques in Computer Science
 |  |
Wall of Fame | Most Viewed RANDOM-1997 Paper
RANDOM
1997
Springer
13 years 8 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
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 |  | 98 | ||
| 2 | | 88 | ||
| 3 | | 82 | ||
| 4 | | 77 |