Florian Bridoux, N. Durbec, Kévin Perrot, A. Richard
{"title":"Complexity of Maximum Fixed Point Problem in Boolean Networks","authors":"Florian Bridoux, N. Durbec, Kévin Perrot, A. Richard","doi":"10.1007/978-3-030-22996-2_12","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Computability in Europe","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-22996-2_12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
