Author:
Xian Aiyong,Zhu Kaiyuan,Zhu Daming,Pu Lianrong
Publisher
Springer International Publishing
Reference27 articles.
1. Lecture Notes in Computer Science;A Avidor,2006
2. Andersson, G., Engebretsen, L.: Better approximation algorithms for set splitting and not-all-equal SAT. Inf. Process. Lett. 65(6), 305–311 (1998)
3. Asano, T., Williamson, D.P.: Improved approximation algorithms for MAX-SAT. J. Algorithms 42(1), 173–202 (2002)
4. Cai, S., Su, K.: Configuration checking with aspiration in local search for SAT. In: Proceedings of AAAI 2012, pp. 434–440 (2012)
5. Chen, J., Friesen, D., Zheng, H.: Tight bound on Johnson’s algorithm for maximum satisfiability. J. comput. syst. sci. 58(3), 622–640 (1999)