The Optimization Complexity of Constraint Satisfaction Problems
暂无分享,去创建一个
[1] Carsten Lund,et al. Proof verification and the intractability of approximation problems , 1992, FOCS 1992.
[2] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[3] Tomás Feder,et al. Monotone monadic SNP and constraint satisfaction , 1993, STOC.
[4] Jacques Stern,et al. The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations , 1997, J. Comput. Syst. Sci..
[5] László Lovász,et al. Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[6] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[7] Richard E. Ladner,et al. On the Structure of Polynomial Time Reducibility , 1975, JACM.
[8] David P. Williamson,et al. The Optimization Complexity of Structure Maximization Problems , 1996 .
[9] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[10] Nadia Creignou. A Dichotomy Theorem for Maximum Generalized Satisfiability Problems , 1995, J. Comput. Syst. Sci..