Santha, Miklos; Szegedy, Mario Quantum and classical query complexities of local search are polynomially related. (English) Zbl 1191.68310 Algorithmica 55, No. 3, 557-575 (2009). MSC: 68Q05 68Q10 68Q25 81P68 PDFBibTeX XMLCite \textit{M. Santha} and \textit{M. Szegedy}, Algorithmica 55, No. 3, 557--575 (2009; Zbl 1191.68310) Full Text: DOI
Magniez, Frédéric; Santha, Miklos; Szegedy, Mario Quantum algorithms for the triangle problem. (English) Zbl 1166.68032 SIAM J. Comput. 37, No. 2, 413-424 (2007). Reviewer: Francesco Scarcello (Rende) MSC: 68R10 05C85 68Q25 81P68 PDFBibTeX XMLCite \textit{F. Magniez} et al., SIAM J. Comput. 37, No. 2, 413--424 (2007; Zbl 1166.68032) Full Text: DOI arXiv
Magniez, Frédéric; Santha, Miklos; Szegedy, Mario Quantum algorithms for the triangle problem. (English) Zbl 1297.68078 Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 1109-1117 (2005). MSC: 68Q12 05C85 PDFBibTeX XMLCite \textit{F. Magniez} et al., in: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23--25, 2005. New York, NY: ACM Press. 1109--1117 (2005; Zbl 1297.68078)
Santha, Miklos; Szegedy, Mario Quantum and classical query complexities of local search are polynomially related. (English) Zbl 1192.68266 Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), Chicago, IL, USA, June 13 - 15, 2004. New York, NY: ACM Press (ISBN 1-58113-852-0). 494-501, electronic only (2004). MSC: 68Q05 68Q10 68Q25 81P68 PDFBibTeX XMLCite \textit{M. Santha} and \textit{M. Szegedy}, in: Proceedings of the 36th annual ACM symposium on theory of computing, STOC 2004. Chicago, IL, USA, June 13--15, 2004. New York, NY: ACM Press. 494--501 (2004; Zbl 1192.68266) Full Text: DOI