{"title":"实时分支程序的指数下界","authors":"Stanislav ák","doi":"10.1016/S0019-9958(86)80018-3","DOIUrl":null,"url":null,"abstract":"<div><p>Branching programs are a general model of sequential computation. One of their computational features is their possibility to question (repeatedly) the information from each input bit. Real-time branching programs make at most <em>n</em> questions when computing on an input of length <em>n</em>. The restriction “real-time” allows to find a simple language which requires the lower bound 2<sup>√2<em>n</em>/8</sup> on memory (= the state space).</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"71 1","pages":"Pages 87-94"},"PeriodicalIF":0.0000,"publicationDate":"1986-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80018-3","citationCount":"8","resultStr":"{\"title\":\"An exponential lower bound for real-time branching programs\",\"authors\":\"Stanislav ák\",\"doi\":\"10.1016/S0019-9958(86)80018-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Branching programs are a general model of sequential computation. One of their computational features is their possibility to question (repeatedly) the information from each input bit. Real-time branching programs make at most <em>n</em> questions when computing on an input of length <em>n</em>. The restriction “real-time” allows to find a simple language which requires the lower bound 2<sup>√2<em>n</em>/8</sup> on memory (= the state space).</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"71 1\",\"pages\":\"Pages 87-94\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80018-3\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995886800183\",\"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/S0019995886800183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
An exponential lower bound for real-time branching programs
Branching programs are a general model of sequential computation. One of their computational features is their possibility to question (repeatedly) the information from each input bit. Real-time branching programs make at most n questions when computing on an input of length n. The restriction “real-time” allows to find a simple language which requires the lower bound 2√2n/8 on memory (= the state space).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
