COCO 2000 Annual IEEE Conference on Computational Complexity
 |  |
Wall of Fame | Most Viewed COCO-2000 Paper
COCO
2000
Springer
13 years 10 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
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 |  | 161 | ||
| 2 | | 125 | ||
| 3 | | 123 | ||
| 4 | | 112 | ||
| 5 | | 107 | ||
| 6 | | 100 | ||
| 7 | | 65 |