Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model

04/07/2022
by   Sreshth Aggarwal, et al.
0

In the adaptive bitprobe model answering membership queries in two bitprobes, we consider the class of restricted schemes as introduced by Kesh and Sharma (Discrete Applied Mathematics 2021). In that paper, the authors showed that such restricted schemes storing subsets of size 2 require Ω(m^2/3) space. In this paper, we generalise the result to arbitrary subsets of size n, and prove that the space required for such restricted schemes will be Ω((m/n)^1 - 1/⌊ n / 4 ⌋ + 2).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/12/2018

An Improved Scheme in the Two Query Adaptive Bitprobe Model

In this paper, we look into the adaptive bitprobe model that stores subs...
research
10/07/2019

Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements

In this paper, we study two-bitprobe adaptive schemes storing five eleme...
research
11/20/2017

On estimating the alphabet size of a discrete random source

We are concerned with estimating alphabet size N from a stream of symbol...
research
10/31/2018

A Two Query Adaptive Bitprobe Scheme Storing Five Elements

We are studying the adaptive bitprobe model to store an arbitrary subset...
research
05/05/2020

Lower Bounds for Semi-adaptive Data Structures via Corruption

In a dynamic data structure problem we wish to maintain an encoding of s...
research
06/30/2011

Restricted Value Iteration: Theory and Algorithms

Value iteration is a popular algorithm for finding near optimal policies...
research
11/06/2019

Permutations With Restricted Movement

We study restricted permutations of sets which have a geometrical struct...

Please sign up or login with your details

Forgot password? Click here to reset