Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5:13–51, 1995.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45:501–555, 1998.
3. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45:70–122, 1998.
4. T. Asano. Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. In Proceedings of the 3nd Israel Symposium on Theory and Computing Systems, Ramat Gan, Israel, pages 24–37, 1997.
5. T. Asano, T. Ono, and T. Hirata. Approximation algorithms for the maximum satisfiability problem. Nordic Journal of Computing, 3:388–404, 1996.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献