随机3-SAT不满意阈值的边界

S. Janson, Y. Stamatiou, M. Vamvakari
{"title":"随机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":"{\"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}","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

摘要

可满足阈值猜想表明,对于随机生成的m个分句公式,其中恰好有k个字面量/n个变量,当n趋于无穷时,该公式可满足的概率从I到0突然变化,因为比值I = m/n为
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Bounding the unsatisfiability threshold of random 3-SAT
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
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Monochromatic paths in random tournaments On Generalized Independent Subsets of Trees Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices On the effect of selection in genetic algorithms The Boyer-Moore-Horspool heuristic with Markovian input
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1