CC 2015 Creativity and Cognition
 |  |
Wall of Fame | Most Viewed CC-2015 Paper
CC
2015
Springer
8 years 8 months ago
2015
Springer
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that t...
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 |  | 39 | ||
| 2 | | 38 | ||
| 3 | | 34 | ||
| 4 | | 33 | ||
| 5 | | 33 | ||
| 6 | | 32 | ||
| 7 | | 28 | ||
| 8 | | 23 | ||
| 9 | | 22 | ||
| 10 | | 22 | ||
| 11 | | 21 | ||
| 12 | | 8 |