Inapproximability results for set splitting and satisfiability problems with no mixed clauses
暂无分享,去创建一个
[1] Uri Zwick,et al. A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[2] Uriel Feige,et al. Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[3] Alessandro Panconesi,et al. Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems , 1996, Inf. Process. Lett..
[4] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[5] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[6] Venkatesan Guruswami,et al. A tight characterization of NP with 3 query PCPs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[7] David P. Williamson,et al. A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction , 1997, STOC '97.
[8] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[9] Venkatesan Guruswami. Query-efficient checking of proofs and improved PCP characterizations of NP , 1999 .
[10] Luca Trevisan,et al. To Weight or Not to Weight: Where is the Question? , 1996, ISTCS.
[11] Ran Raz. A Parallel Repetition Theorem , 1998, SIAM J. Comput..
[12] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.
[13] Venkatesan Guruswami,et al. The Approximability of Set Splitting Problems and Satisfiability Problems with no Mixed Clauses , 1999, Electron. Colloquium Comput. Complex..
[14] Luca Trevisan,et al. Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[15] Uri Zwick,et al. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems , 1999, STOC '99.
[16] Johan Håstad,et al. Some optimal inapproximability results , 1997, STOC '97.
[17] Lars Engebretsen,et al. Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT , 1998, Inf. Process. Lett..