查找隐藏排列的查询复杂度

{"title":"查找隐藏排列的查询复杂度","authors":"P. Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, K. Mehlhorn","doi":"10.1007/978-3-642-40273-9_1","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":160496,"journal":{"name":"Space-Efficient Data Structures, Streams, and Algorithms","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"The Query Complexity of Finding a Hidden Permutation\",\"authors\":\"P. Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, K. Mehlhorn\",\"doi\":\"10.1007/978-3-642-40273-9_1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":160496,\"journal\":{\"name\":\"Space-Efficient Data Structures, Streams, and Algorithms\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Space-Efficient Data Structures, Streams, and Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-642-40273-9_1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Space-Efficient Data Structures, Streams, and Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-642-40273-9_1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}