Author:
Zhu Daming,Ma Shaohan,Zhang Pingping
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theorey of Computing, Shaker Heights, Ohio,USA, pp. 151–158. ACM, New York (1971)
2. Papadimitriou, C.H., Yanakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43(3), 425–440 (1991)
3. Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9(3), 256–278 (1974)
4. Chen, J., Friesen, D., Zheng, H.: Tight bound on Johnson’s algorithm for maximum satisfiability. Journal of Computer and System Sciences 58(3), 622–640 (1999)
5. Yannakakis, M.: On the approximation of maximum satisfiability. Journal of Algorithms 17, 475–502 (1994)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献