Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing
From MaRDI portal
Publication:5741816
DOI10.1137/1.9781611973105.107zbMath1422.68078arXiv1210.1014OpenAlexW2951630006MaRDI QIDQ5741816
Troy Lee, Miklos Santha, Frédéric Magniez
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.1014
Graph algorithms (graph-theoretic aspects) (05C85) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (4)
Quantum algorithms for finding constant-sized sub-hypergraphs ⋮ Three-state quantum walk on the Cayley graph of the dihedral group ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Quantum algorithms for learning symmetric juntas via the adversary bound
This page was built for publication: Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing
