{"title":"资源有限测度与随机性","authors":"K. Ambos-Spies, E. Mayordomo","doi":"10.1201/9780429187490-1","DOIUrl":null,"url":null,"abstract":"We survey recent results on resource-bounded measure and random-ness in structural complexity theory. In particular, we discuss applications of these concepts to the exponential time complexity classes E and E2. Moreover, we treat time-bounded genericity and stochasticity concepts which are weaker than time-bounded randomness but which suuce for many of the applications in complexity theory.","PeriodicalId":420984,"journal":{"name":"complexity, logic, and recursion theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Resource-Bounded Measure and Randomness\",\"authors\":\"K. Ambos-Spies, E. Mayordomo\",\"doi\":\"10.1201/9780429187490-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We survey recent results on resource-bounded measure and random-ness in structural complexity theory. In particular, we discuss applications of these concepts to the exponential time complexity classes E and E2. Moreover, we treat time-bounded genericity and stochasticity concepts which are weaker than time-bounded randomness but which suuce for many of the applications in complexity theory.\",\"PeriodicalId\":420984,\"journal\":{\"name\":\"complexity, logic, and recursion theory\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"complexity, logic, and recursion theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1201/9780429187490-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":"complexity, logic, and recursion theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/9780429187490-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We survey recent results on resource-bounded measure and random-ness in structural complexity theory. In particular, we discuss applications of these concepts to the exponential time complexity classes E and E2. Moreover, we treat time-bounded genericity and stochasticity concepts which are weaker than time-bounded randomness but which suuce for many of the applications in complexity theory.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
