An Improved Scheme in the Two Query Adaptive Bitprobe Model

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
04/07/2022

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

In the adaptive bitprobe model answering membership queries in two bitpr...
research
02/21/2022

Learning Low Degree Hypergraphs

We study the problem of learning a hypergraph via edge detecting queries...
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
10/18/2022

A Note on Robust Subsets of Transversal Matroids

Robust subsets of matroids were introduced by Huang and Sellier to propo...
research
05/07/2020

Détermination Automatique des Fonctions d'Appartenance et Interrogation Flexible et Coopérative des Bases de Données

Flexible querying of DB allows to extend DBMS in order to support imprec...
research
04/22/2015

Non-Adaptive Policies for 20 Questions Target Localization

The problem of target localization with noise is addressed. The target i...

Please sign up or login with your details

Forgot password? Click here to reset