Survey propagation: An algorithm for satisfiability 论文
2005Random Structures and Algorithms引用 250
Bayesian Modeling and Causal InferenceRough Sets and Fuzzy LogicData Management and Algorithms
摘要
We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be most difficult when ...
作者
暂无数据
相关事件
暂无数据
相关文章
暂无数据