Abstract
We study the computational complexity of decision and optimization problems that may be expressed as boolean contraint satisfaction problem with the global cardinality constraints. In this paper we establish a characterization theorem for the decision problems and derive some new approximation hardness results for the corresponding global optimization problems. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Bazgan, C., & Karpinski, M. (2005). On the complexity of global constraint satisfaction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3827 LNCS, pp. 624–633). https://doi.org/10.1007/11602613_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
