双自适应位探针模型中受限格式的下界

International Workshop on Combinatorial Algorithms Pub Date : 2022-04-07 DOI:10.48550/arXiv.2204.03266

Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal

{"title":"双自适应位探针模型中受限格式的下界","authors":"Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal","doi":"10.48550/arXiv.2204.03266","DOIUrl":null,"url":null,"abstract":". In the adaptive bitprobe model answering membership queries in two bitprobes, we consider the class of restricted schemes as introduced by Kesh and Sharma [1]. In that paper, the authors showed that such restricted schemes storing subsets of size 2 require Ω ( m 23 ) 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","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"200 1‐2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model\",\"authors\":\"Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal\",\"doi\":\"10.48550/arXiv.2204.03266\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". In the adaptive bitprobe model answering membership queries in two bitprobes, we consider the class of restricted schemes as introduced by Kesh and Sharma [1]. In that paper, the authors showed that such restricted schemes storing subsets of size 2 require Ω ( m 23 ) 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\",\"PeriodicalId\":403593,\"journal\":{\"name\":\"International Workshop on Combinatorial Algorithms\",\"volume\":\"200 1‐2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Combinatorial Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2204.03266\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Combinatorial Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2204.03266","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

．在回答两个位探针中的隶属度查询的自适应位探针模型中，我们考虑了由Kesh和Sharma[1]引入的一类受限方案。在那篇论文中，作者证明了这种存储大小为2的子集的受限方案需要Ω (m 23)空间。在本文中，我们将结果推广到任意大小为n的子集，并证明了这种受限方案所需的空间为

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

. In the adaptive bitprobe model answering membership queries in two bitprobes, we consider the class of restricted schemes as introduced by Kesh and Sharma [1]. In that paper, the authors showed that such restricted schemes storing subsets of size 2 require Ω ( m 23 ) 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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Workshop on Combinatorial Algorithms

自引率

0.00%

发文量