{"title":"Satisfiability in Boolean Logic (SAT problem) is polynomial?","authors":"V. Rybakov","doi":"10.17516/1997-1397-2021-14-5-667-671","DOIUrl":null,"url":null,"abstract":"We find a polynomial algorithm to solve SAT problem in Boolean Logic","PeriodicalId":43965,"journal":{"name":"Journal of Siberian Federal University-Mathematics & Physics","volume":"1 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Siberian Federal University-Mathematics & Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17516/1997-1397-2021-14-5-667-671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
We find a polynomial algorithm to solve SAT problem in Boolean Logic
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
