共 50 条
- [31] Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2021, 2021 (03):
- [32] An Efficient Approach to Solving Random k-sat Problems Journal of Automated Reasoning, 2006, 37 : 261 - 276
- [34] kcnfs:: An efficient solver for random k-SAT formulae THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 486 - 501
- [35] The high temperature case for the random K-sat problem Probability Theory and Related Fields, 2001, 119 : 187 - 212
- [36] An efficient approach to solving random k-sat problems Journal of Automated Reasoning, 2006, 37 (04): : 261 - 276
- [39] Complexity of k-SAT FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 237 - 240