Separations in query complexity based on pointer functions

DOI10.1145/2897518.2897524MaRDI QIDQ6829586zbMATH OpenFDO

Authors Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, J. Smotrovs

Publication date 29 September 2017

Published in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

zbMATH Keywords

Monte Carlorandomized algorithmsquantum algorithmsdeterministic algorithmsLas Vegas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Quantum algorithms and complexity in the theory of computing (68Q12)

This page was built for publication: Separations in query complexity based on pointer functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829586)