{"title":"Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages","authors":"D. Cantone, P. Maugeri, E. Omodeo","doi":"10.2139/ssrn.4163424","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"1 1","pages":"113786"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theor. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.4163424","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
