Howard Barnum, Michael E. Saks. A lower bound on the quantum query complexity of read-once functions. Electronic Colloquium on Computational Complexity (ECCC), (002), 2002. [doi]
No references recorded for this publication.
No citations of this publication recorded.