{"title":"有限元胞自动机可逆性问题的平均情况复杂度","authors":"A. Clementi, P. Pierini, R. Impagliazzo","doi":"10.1109/PHYCMP.1994.363687","DOIUrl":null,"url":null,"abstract":"Of particular relevance in the theory and applications of cellular automata is the concept of invertibility. We study the computational complexity of deciding whether or not a given finite cellular automata is invertible. This problem is known to be CoNP-complete, we prove that the expected-time complexity of its randomized version is \"hard\": the problem is CoRNP-complete. Finally, we discuss some consequences of this result in the theory and applications of cellular automata.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the average-case complexity of the reversibility problem for finite cellular automata\",\"authors\":\"A. Clementi, P. Pierini, R. Impagliazzo\",\"doi\":\"10.1109/PHYCMP.1994.363687\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Of particular relevance in the theory and applications of cellular automata is the concept of invertibility. We study the computational complexity of deciding whether or not a given finite cellular automata is invertible. This problem is known to be CoNP-complete, we prove that the expected-time complexity of its randomized version is \\\"hard\\\": the problem is CoRNP-complete. Finally, we discuss some consequences of this result in the theory and applications of cellular automata.<<ETX>>\",\"PeriodicalId\":378733,\"journal\":{\"name\":\"Proceedings Workshop on Physics and Computation. PhysComp '94\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Workshop on Physics and Computation. PhysComp '94\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PHYCMP.1994.363687\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Workshop on Physics and Computation. PhysComp '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PHYCMP.1994.363687","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the average-case complexity of the reversibility problem for finite cellular automata
Of particular relevance in the theory and applications of cellular automata is the concept of invertibility. We study the computational complexity of deciding whether or not a given finite cellular automata is invertible. This problem is known to be CoNP-complete, we prove that the expected-time complexity of its randomized version is "hard": the problem is CoRNP-complete. Finally, we discuss some consequences of this result in the theory and applications of cellular automata.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
