{"title":"论复杂性类BPC和TC的重合性 $${}^{0}$$","authors":"I. V. Savitskii","doi":"10.3103/s0278641922040069","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>It is shown that the class of dictionary functions defined on the basis of bounded prefix concatenation coincides with the familiar complexity class <span>\\(\\textrm{TC}^{0}\\)</span>.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"7 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Coincidence of Complexity Classes BPC and TC $${}^{0}$$\",\"authors\":\"I. V. Savitskii\",\"doi\":\"10.3103/s0278641922040069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3 data-test=\\\"abstract-sub-heading\\\">Abstract</h3><p>It is shown that the class of dictionary functions defined on the basis of bounded prefix concatenation coincides with the familiar complexity class <span>\\\\(\\\\textrm{TC}^{0}\\\\)</span>.</p>\",\"PeriodicalId\":501582,\"journal\":{\"name\":\"Moscow University Computational Mathematics and Cybernetics\",\"volume\":\"7 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Moscow University Computational Mathematics and Cybernetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3103/s0278641922040069\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow University Computational Mathematics and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3103/s0278641922040069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Coincidence of Complexity Classes BPC and TC $${}^{0}$$
Abstract
It is shown that the class of dictionary functions defined on the basis of bounded prefix concatenation coincides with the familiar complexity class \(\textrm{TC}^{0}\).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
