The quantum complexity of set membership

DOI10.1007/S00453-002-0979-0MaRDI QIDQ1871635zbMATH OpenOpenAlexFDO

Authors 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

Bit probe modelData structuresLinear algebraic methodsLower boundsQuantum black box modelSet membershipSpace-time tradeoffs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1754604
• Set membership with a few bit probes
• Set membership with non-adaptive bit probes
• scientific article; zbMATH DE number 1875423
• Are bitvectors optimal?

Cited in

(2)

• scientific article; zbMATH DE number 1754604 (Why is no real title available?)
• Automata, Languages and Programming

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

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