The pure literal rule threshold and cores in random hypergraphs
The pure literal rule threshold and cores in random hypergraphs
复制标题
随机超图中的纯字面规则阈值和核心
DOI:
--
复制
发表时间:
2004
期刊:
影响因子:
--
通讯作者:
Michael Molloy
中科院分区:
文献类型:
--
作者:
Michael Molloy
We describe a technique for determining the thresholds for the appearance of cores in random structures. We use it to determine (i) the threshold for the pure literal rule to find a satisfying assignment for a random instance of <i>r</i>-SAT, <i>r</i> ≥ 3, and (ii) the threshold for the appearance of a <i>k</i>-core in a random <i>r</i>-uniform hypergraph for all <i>r, k</i> ≥ 2, <i>r</i> + <i>k</i> > 4.