FOCS 1991 Annual IEEE Symposium on Foundations of Computer Science
 |  |
Wall of Fame | Most Viewed FOCS-1991 Paper
FOCS
1991
IEEE
14 years 2 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
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 |  | 224 | ||
| 2 | | 163 | ||
| 3 | | 126 | ||
| 4 | | 116 | ||
| 5 | | 115 | ||
| 6 | | 114 | ||
| 7 | | 110 | ||
| 8 | | 106 | ||
| 9 | | 98 | ||
| 10 | | 89 |