S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof Verification, ...
traversal sequences, and the complexity of maze problems. In 20th FOCS, pages 218-223, 1979.
All Quantum Adversary Methods are Equivalent (2005)
The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equal: spectral adversary [Barnum, Saks, and...
All Quantum Adversary Methods are Equivalent (2005)
The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equal: spectral adversary [Barnum, Saks, and...