{"title":"The complexity of Boolean formula minimization","authors":"David Buchfuhrer, C. Umans","doi":"10.1007/978-3-540-70575-8_3","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":346691,"journal":{"name":"Journal of computer and system sciences (Print)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"81","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of computer and system sciences (Print)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-540-70575-8_3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
