arXiv (All)
open access
Revisiting Non-Adaptive Set Membership Schemes: Removing the Logarithmic Factor
We study non-adaptive bit-probe schemes for static set membership. Each query reads a fixed number of bits and answers by strict majority. We revisit the random bipartite-graph construction of Garg and Radhakrishnan [STACS, 2017]. The main observation is that a slightly stronger expansion property a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quantifying Randomness in Stochastic Bit Sequences / Christoph Lange, Andreas Ahrens, Yadu Krishnan Krishnakumar, Denise Engert, Ming Yin ; Herausgeber: Nikos Fotiou#1106459
- An Improvement to the Upper Bound for Marton's Covering Conjecture#799548
- An Improvement to the Upper Bound for Marton's Covering Conjecture#798125
- Learning Latent Algebraic Structure from Ambiguous Set Observations#1117533
- Quantifying Randomness in Stochastic Bit Sequences.#455479
Record · ID 1354394
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive