Set membership with two classical and quantum bit probes

DOI10.4230/LIPICS.ICALP.2022.52MaRDI QIDQ6560844zbMATH OpenFDO

Authors Shyam S. Dhamapurkar, Shubham Vivek Pawar, Jaikumar Radhakrishnan

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.52

zbMATH Keywords

bit probe complexitygraphs with high girthquantum data structureset membership problem

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: Set membership with two classical and quantum bit probes

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