An Improved Scheme in the Two Query Adaptive Bitprobe Model
COMBINATORIAL ALGORITHMS, IWOCA 2019(2018)
摘要
In this paper, we look into the adaptive bitprobe model that stores subsets of size at most four from a universe of size m, and answers membership queries using two bitprobes. We propose a scheme that stores arbitrary subsets of size four using O(m^{5/6}) amount of space. This improves upon the non-explicit scheme proposed by Garg and Radhakrishnan [Garg2015] which uses O(m^{16/17}) amount of space, and the explicit scheme proposed by Garg [Thesis2015] which uses O(m^{14/15}) amount of space.
更多查看译文
关键词
Data structure, Set membership problem, Bitprobe model, Adaptive scheme
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要