COCO   2000 Annual IEEE Conference on Computational Complexity
Wall of Fame | Most Viewed COCO-2000 Paper
161views Algorithms» more  COCO 2000»
13 years 10 months ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
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 ...
Ronald de Wolf
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.
1Download preprint from source161
2Download preprint from source125
3Download preprint from source123
4Download preprint from source112
5Download preprint from source107
6Download preprint from source100
7Download preprint from source65