Miklos Santha, Mario Szegedy
Quantum and classical query complexities of local search are polynomially related
STOC, 2004.
@inproceedings{STOC-2004-SanthaS,
author = "Miklos Santha and Mario Szegedy",
booktitle = "{Proceedings of the 36th Annual ACM Symposium on Theory of Computing}",
doi = "10.1145/1007352.1007427",
isbn = "1-58113-852-0",
pages = "494--501",
publisher = "{ACM}",
title = "{Quantum and classical query complexities of local search are polynomially related}",
year = 2004,
}











