{"title":"Bounding the unsatisfiability threshold of random 3-SAT","authors":"S. Janson, Y. Stamatiou, M. Vamvakari","doi":"10.1002/1098-2418(200009)17:2%3C103::AID-RSA2%3E3.0.CO;2-P","DOIUrl":null,"url":null,"abstract":"The satisfiability threshold conjecture states that fur a randomly generated formula of m clauses of exactly k literals over n variables, the probability that it is satisfiable, as n tends to infinity, changes abruptly from I to 0, as the ratio I = m/n is","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"83","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/1098-2418(200009)17:2%3C103::AID-RSA2%3E3.0.CO;2-P","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 83
Abstract
The satisfiability threshold conjecture states that fur a randomly generated formula of m clauses of exactly k literals over n variables, the probability that it is satisfiable, as n tends to infinity, changes abruptly from I to 0, as the ratio I = m/n is
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
