STACS 2000 Annual Symposium on Theoretical Aspects of Computer Science
 |  |
Wall of Fame | Most Viewed STACS-2000 Paper
STACS
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
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 | | 109 | ||
| 3 | | 101 | ||
| 4 | | 101 | ||
| 5 | | 97 | ||
| 6 | | 95 | ||
| 7 | | 94 | ||
| 8 | | 94 | ||
| 9 | | 90 | ||
| 10 | | 85 | ||
| 11 | | 81 | ||
| 12 | | 79 | ||
| 13 | | 76 | ||
| 14 | | 75 |