The quantum complexity of set membership

DOI10.1007/s00453-002-0979-0zbMath1050.68031OpenAlexW1506737464MaRDI QIDQ1871635

Yanyan Li

Publication date: 4 May 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0979-0

zbMATH Keywords

Data structuresLower boundsBit probe modelLinear algebraic methodsQuantum black box modelSet membershipSpace-time tradeoffs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Data structures (68P05)

This page was built for publication: The quantum complexity of set membership