Scott Aaronson. Quantum Lower Bound for Approximate Counting Via Laurent Polynomials. Electronic Colloquium on Computational Complexity (ECCC), 25:137, 2018. [doi]
No references recorded for this publication.
No citations of this publication recorded.