Random walks and Brownian motion

被引:0
|
作者
Castell, T [1 ]
机构
[1] Univ Toulouse 3, IRIT, F-31062 Toulouse 04, France
来源
COMPUTERS AND ARTIFICIAL INTELLIGENCE | 1999年 / 18卷 / 02期
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Papadimitriou proved in [7] that the random walk algorithm is a polynomial Monte-Carlo algorithm for the satisfiable instances of 2SAT. We present a convergence criterion that generalizes it. We used it to demonstrate that the random walk algorithm is also a polynomial Monte-Carlo algorithm for the satisfiable Horn-renamable instances of SAT without unitary clauses.
引用
收藏
页码:209 / 214
页数:6
相关论文
共 50 条