用拜占庭机器人在一条线上搜索的更好上界

{"title":"用拜占庭机器人在一条线上搜索的更好上界","authors":"Xiaoming Sun, Yuan Sun, Jialin Zhang","doi":"10.1007/978-3-030-41672-0_9","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Better Upper Bounds for Searching on a Line with Byzantine Robots\",\"authors\":\"Xiaoming Sun, Yuan Sun, Jialin Zhang\",\"doi\":\"10.1007/978-3-030-41672-0_9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":283980,\"journal\":{\"name\":\"Complexity and Approximation\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complexity and Approximation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-41672-0_9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity and Approximation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-41672-0_9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}