Separations in Query Complexity Based on Pointer Functions
From MaRDI portal
Publication:4640297
DOI10.1145/3106234zbMath1426.68109arXiv1506.04719MaRDI QIDQ4640297
Andris Ambainis, J. Smotrovs, Troy Lee, Miklos Santha, Aleksandrs Belovs, Kaspars Balodis
Publication date: 17 May 2018
Published in: Journal of the ACM, Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.04719
Monte Carlo; quantum algorithms; deterministic algorithms; decision trees; randomized algorithms; Las Vegas; query complexity
68Q25: Analysis of algorithms and problem complexity
68W20: Randomized algorithms
68Q12: Quantum algorithms and complexity in the theory of computing