Author:
Boufkhad Yacine,Dubois Olivier,Interian Yannet,Selman Bart
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference26 articles.
1. Achlioptas, D. (2001): Lower bounds for random 3-SAT via differential equations, Theor. Comp. Sci. 265, pp. 159–185.
2. Achlioptas, D. and Moore, C. (2002): The asymptotic order of the random k-SAT threshold, in 43th Annual Symposium on Foundations of Computer Science, Vancouver, pp. 779–788.
3. Achlioptas, D. and Peres, Y. (2004): The threshold for random k-SAT is 2 k ln2 –O(k), J. Amer. Math. Soc. 17, 947–973.
4. Achlioptas, D., Gomes, C. P., Kautz, H. A., and Selman, B. (2000): Generating satisfiable problems instances, in Proceedings of 17th National Conference on Artificial Intelligence, pp. 256–261.
5. Bayardo, R. J. and Schrag, R. (1996): Using CSP look-back techniques to solve exceptionally hard SAT instances, in Proceedings of the Second Int. Conf. on Principles and Practice of Constraint Programming, pp. 46–60.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献