乌兰用谎言搜索的一个问题的解决

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI:10.1109/ISIT.1998.708849

R. Hill, Jehangir P. Karim, E. Berlekamp

{"title":"乌兰用谎言搜索的一个问题的解决","authors":"R. Hill, Jehangir P. Karim, E. Berlekamp","doi":"10.1109/ISIT.1998.708849","DOIUrl":null,"url":null,"abstract":"We consider Ulam's problem of determining the minimum number of yes-no queries to find an unknown integer between 1 and 2/sup 20/ if at most some given number e of the answers may be lies. Previously published papers have solved the problem for cases e=1,2,3 and 4. In this paper we solve the problem for all values of e.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"The solution of a problem of Ulam on searching with lies\",\"authors\":\"R. Hill, Jehangir P. Karim, E. Berlekamp\",\"doi\":\"10.1109/ISIT.1998.708849\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider Ulam's problem of determining the minimum number of yes-no queries to find an unknown integer between 1 and 2/sup 20/ if at most some given number e of the answers may be lies. Previously published papers have solved the problem for cases e=1,2,3 and 4. In this paper we solve the problem for all values of e.\",\"PeriodicalId\":133728,\"journal\":{\"name\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1998.708849\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.708849","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 17

摘要

我们考虑Ulam的问题，即确定在1到2之间找到一个未知整数的最小yes-no查询的数量/sup 20/如果最多有某个给定的数字e可能是谎言。之前发表的论文已经解决了情况e=1,2,3和4的问题。在本文中，我们求解了所有e值的问题。

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

查看原文本刊更多论文

The solution of a problem of Ulam on searching with lies

We consider Ulam's problem of determining the minimum number of yes-no queries to find an unknown integer between 1 and 2/sup 20/ if at most some given number e of the answers may be lies. Previously published papers have solved the problem for cases e=1,2,3 and 4. In this paper we solve the problem for all values of e.

求助全文

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

来源期刊

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)

自引率

0.00%

发文量