JC 2006
 |  |
Wall of Fame | Most Viewed JC-2006 Paper
JC
2006
14 years 16 days ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
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 |  | 139 | ||
| 2 | | 115 | ||
| 3 | | 105 | ||
| 4 | | 97 | ||
| 5 | | 87 | ||
| 6 | | 86 | ||
| 7 | | 68 | ||
| 8 | | 62 | ||
| 9 | | 62 | ||
| 10 | | 61 | ||
| 11 | | 57 | ||
| 12 | | 55 | ||
| 13 | | 53 | ||
| 14 | | 53 | ||
| 15 | | 35 |