Random walk algorithms for SAT and constraint satisfaction problems
作者： Stefan Schneider
关键词:
摘要:
sci-hub.st 参考文章(19)
Francis Galton, H. W. Watson, On the Probability of the Extinction of Families The Journal of the Anthropological Institute of Great Britain and Ireland. ,vol. 4, pp. 399- 406 ,(1875) , 10.1007/978-3-642-81046-6_44
Andrei Giurgiu, Random walk algorithms for SAT ETH, Eidgenössische Technische Hochschule Zürich, Department of Computer Science, Institute of Theoretical Computer Science. ,(2009) , 10.3929/ETHZ-A-005939758
Dominik Scheder, Guided Search and a Faster Deterministic Algorithm for 3-SAT Lecture Notes in Computer Science. pp. 60- 71 ,(2008) , 10.1007/978-3-540-78773-0_6
Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe, A Probabilistic 3-SAT Algorithm Further Improved symposium on theoretical aspects of computer science. pp. 192- 202 ,(2002) , 10.1007/3-540-45841-7_15
Dominik Scheder, Using a Skewed Hamming Distance to Speed Up Deterministic Local Search arXiv: Computational Complexity. ,(2010)
Liang Li, Tian Liu, Ke Xu, Xin Li, From k-SAT to k-CSP: Two Generalized Algorithms arXiv: Data Structures and Algorithms. ,(2008)
Bart Selman, David Mitchell, Hector Levesque, A new method for solving hard satisfiability problems national conference on artificial intelligence. pp. 440- 446 ,(1992)
C.H. Papadimitriou, On selecting a satisfying truth assignment [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. pp. 163- 169 ,(1991) , 10.1109/SFCS.1991.185365
Geoffrey R. Grimmett, David Stirzaker, Probability and random processes ,(1982)
Tomás Feder, Rajeev Motwani, Worst-case time bounds for coloring and satisfiability problems Journal of Algorithms. ,vol. 45, pp. 192- 201 ,(2002) , 10.1016/S0196-6774(02)00224-9