Set membership with non-adaptive bit probes
Abstract
We consider the non-adaptive bit-probe complexity of the set membership problem, where a set S of size at most n from a universe of size m is to be represented as a short bit vector in order to answer membership queries of the form "Is x in S?" by non-adaptively probing the bit vector at t places. Let s_N(m,n,t) be the minimum number of bits of storage needed for such a scheme. In this work, we show existence of non-adaptive and adaptive schemes for a range of t that improves an upper bound of Buhrman, Miltersen, Radhakrishnan and Srinivasan (2002) on s_N(m,n,t). For three non-adaptive probes, we improve the previous best lower bound on s_N(m,n,3) by Alon and Feige (2009).
Keywords
Cite
@article{arxiv.1612.09388,
title = {Set membership with non-adaptive bit probes},
author = {Mohit Garg and Jaikumar Radhakrishnan},
journal= {arXiv preprint arXiv:1612.09388},
year = {2017}
}
Comments
31 pages, full version of 'Set membership with non-adaptive bit probes. STACS 2017 (to appear)'. arXiv admin note: text overlap with arXiv:1504.02035