Author:
Bačík Roman,Mahajan Sanjeev
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Bačík R. and Mahajan S.: Semidefinite Programming and its Applications to NP Problems. Electronic Colloquium on Computational Complexity (1995) TR95-011
2. Chvátal V.: Linear Programming. W.H. Freeman and Company (1983), New York.
3. Feder T. and Vardi M.Y.: Monotone Monadic SNP and constraint Satisfaction. 25th ACM Symposium on Theory of Computing (1993) 612–622
4. Feige U. and Lovász L.: Two-Prover One-Round Proof Systems: Their Power and Their Problems. 24th Annual ACM Symposium on Theory of Computing (1992) 733–744
5. Goemans M.X. and Williamson D.P.:. 878-Approximation Algorithms for MAX CUT and MAX 2SAT. 26th Annual ACM Symposium on Theory of Computing (1994) 422–431
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献