The polynomial method strikes back: tight quantum query bounds via dual polynomials
Saved in:
| Published in | Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Online Access | Get full text |
| DOI | 10.1145/3188745.3188784 |
Cover
| DOI: | 10.1145/3188745.3188784 |
|---|