An Optimal Separation of Randomized and Quantum Query Complexity
- Award ID(s):
- 1814947
- PAR ID:
- 10328441
- Date Published:
- Journal Name:
- 53rd Annual ACM SIGACT Symposium on Theory of Computing
- Page Range / eLocation ID:
- 1289 - 1302
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government

