{"title":"一种数据效率最佳的同构推理算法","authors":"Peter A. Flangan","doi":"10.1016/S0019-9958(86)80036-5","DOIUrl":null,"url":null,"abstract":"<div><p>The time, space, and data complexity of an optimally data efficient isomorphism identification algorithm are presented. The data complexity, the amount of data required for an inference algorithm to terminate, is analyzed and shown to be the minimum possible for all possible isomorphism inference algorithms. The minimum data requirement is shown to be ⌈log<sub>2</sub> (<em>n</em>)⌉, and a method for constructing this minimal sequence of data is presented. The average data requirement is shown to be approximately 2 log<sub>2</sub>(<em>n</em>). The time complexity is <em>O</em>(<em>n</em><sup>2</sup>log<sub>2</sub>(<em>n</em>)) and the space requirement is <em>O</em>(<em>n</em><sup>2</sup>)</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"68 1","pages":"Pages 207-222"},"PeriodicalIF":0.0000,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80036-5","citationCount":"1","resultStr":"{\"title\":\"An optimally data efficient isomorphism inference algorithm\",\"authors\":\"Peter A. Flangan\",\"doi\":\"10.1016/S0019-9958(86)80036-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The time, space, and data complexity of an optimally data efficient isomorphism identification algorithm are presented. The data complexity, the amount of data required for an inference algorithm to terminate, is analyzed and shown to be the minimum possible for all possible isomorphism inference algorithms. The minimum data requirement is shown to be ⌈log<sub>2</sub> (<em>n</em>)⌉, and a method for constructing this minimal sequence of data is presented. The average data requirement is shown to be approximately 2 log<sub>2</sub>(<em>n</em>). The time complexity is <em>O</em>(<em>n</em><sup>2</sup>log<sub>2</sub>(<em>n</em>)) and the space requirement is <em>O</em>(<em>n</em><sup>2</sup>)</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"68 1\",\"pages\":\"Pages 207-222\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80036-5\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995886800365\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995886800365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
An optimally data efficient isomorphism inference algorithm
The time, space, and data complexity of an optimally data efficient isomorphism identification algorithm are presented. The data complexity, the amount of data required for an inference algorithm to terminate, is analyzed and shown to be the minimum possible for all possible isomorphism inference algorithms. The minimum data requirement is shown to be ⌈log2 (n)⌉, and a method for constructing this minimal sequence of data is presented. The average data requirement is shown to be approximately 2 log2(n). The time complexity is O(n2log2(n)) and the space requirement is O(n2)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
