Andrei A. Bulatov
Skip Abstract Section
Abstract
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a certain value. We study the complexity of the problem CCSP(Γ), the CSP with global cardinality constraints that allows only relations from the set Γ. The main result of this paper characterizes sets Γ that give rise to problems solvable in polynomial time, and states that the remaining such problems are NP-complete.
- Allen, J. Natural Language Understanding. Benjamin Cummihgs, 1994.Google Scholar
- Allender, E., Bauland, M., Immerman, N., Schnoor, H., Vollmer, H. The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. 75, 4 (2009), 245--254. Google ScholarDigital Library
- Barto, L., Kozik, M. Constraint satisfaction problems of bounded width. In FOCS (2009), 595--603. Google ScholarDigital Library
- Barto, L., Kozik, M. New conditions for Taylor varieties and CSP. In LICS, 2010. to appear. Google ScholarDigital Library
- Bazgan, C., Karpinski, M. On the complexity of global constraint satisfaction. In ISAAC (2005), 624--633. Google ScholarDigital Library
- Bessière, C., Hebrard, E., Hnich, B., Walsh, T. The complexity of global constraints. In AAAI (2004), 112--117. Google ScholarDigital Library
- Bulatov, A. Tractable conservative constraint satisfaction problems. In LICS (2003), 321--330. Google ScholarDigital Library
- Bulatov, A., Jeavons, P., Krokhin, A. Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. In ISMVL (2003), 343--351. Google ScholarDigital Library
- Bulatov, A.A. A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM 53, 1 (2006), 66--120. Google ScholarDigital Library
- Bulatov, A.A., Krokhin, A.A., Larose, B. Dualities for constraint satisfaction problems. In Complexity of Constraints (2008), 93--124. Google ScholarDigital Library
- Bulatov, A.A., Marx, D. Constraint satisfaction parameterized by solution size. Manuscript.Google Scholar
- Bulatov, A.A., Marx, D. The complexity of global cardinality constraints. In LICS (2009), 419--428. Google ScholarDigital Library
- Bulatov, A.A., Valeriote, M. Recent results on the algebraic approach to the CSP. In Complexity of Constraints (2008), 68--92. Google ScholarDigital Library
- Creignou, N., Schnoor, H., Schnoor, I. Non-uniform boolean constraint satisfaction problems with cardinality constraint. In CSL (2008), 109--123. Google ScholarDigital Library
- Dechter, R. Constraint Processing. Morgan Kaufmann Publishers, 2003. Google ScholarDigital Library
- Denecke, K., Wismath, S. Universal Algebra and Applications in Theoretical Computer Science. Chapman and Hall, CRC Press, 2002. Google ScholarDigital Library
- Dunkin, N., Bater, J., Jeavons, P., Cohen, D. Toward high order constraint represenations for the frequency assignment problem. Technical Report CSD-TR-98--05, Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, UK, 1998.Google Scholar
- Feder, T., Vardi, M. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput. 28 (1998), 57--104. Google ScholarDigital Library
- Freuder, E. Synthesizing constraint expressions. Commun. ACM 21, (1978) 958--966. Google ScholarDigital Library
- Freuder, E.C. Complexity of k-tree structured constraint satisfaction problems. In Proceedings of AAAI-90 (Boston, MA, 1990), 4--9.Google ScholarDigital Library
- Grohe, M. The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54, 1 (2007). Google ScholarDigital Library
- Hell, P., Nesetril, J. Colouring, constraint satisfaction, and complexity. Comput. Sci. Rev. 2, 3 (2008), 143--163. Google ScholarDigital Library
- Jeavons, P., Cohen, D., Gyssens, M. Closure properties of constraints. J. ACM 44 (1997), 527--548. Google ScholarDigital Library
- Kautz, H.A., Selman, B. Planning as satisfiability. In ECAI (1992), 359--363. Google ScholarDigital Library
- Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P. The approximability of constraint satisfaction problems. SIAM J. Comput. 30, 6 (2001) 1863--1920. Google ScholarDigital Library
- Kolaitis, P., Vardi, M. Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci. 61 (2000), 302--332. Google ScholarDigital Library
- Kratsch, S., Marx, D., Wahlström, M. Parameterized complexity and kernelizability of Max Ones and Exact Ones problems. Submitted, 2010.Google Scholar
- Ladner, R. On the structure of polynomial time reducibility. J. ACM 22 (1975), 155--171. Google ScholarDigital Library
- Larose, B., Tesson, P. Universal algebra and hardness results for constraint satisfaction problems. In ICALP (2007), 267--278. Google ScholarDigital Library
- Marx, D. Parameterized complexity of constraint satisfaction problems. Comput. Complex. 14, 2 (2005), 153--183. Special issue "Conference on Computational Complexity (CCC) 2004". Google ScholarDigital Library
- Marx, D. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In STOC (2010), to appear. Google ScholarDigital Library
- Montanari, U. Networks of constraints: Fundamental properties and applications to picture processing. Inf. Sci. 7 (1974), 95--132.Google ScholarCross Ref
- Nadel, B. Constraint satisfaction in Prolog: Complexity and theory-based heuristics. Inf. Sci. 83, 3--4 (1995), 113--131. Google ScholarDigital Library
- Schaefer, T. The complexity of satisfiability problems. In STOC (1978), 216--226. Google ScholarDigital Library
- van Beek, P. Reasoning about qualitative temporal information. Artif. Intell. 58 (1992), 297--326. Google ScholarDigital Library
Index Terms
- Constraint satisfaction problems and global cardinality constraints
Recommendations
Parameterized algorithms for constraint satisfaction problems above average with global cardinality constraints
SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete AlgorithmsGiven a constraint satisfaction problem (CSP) on n variables, x1, x2, . . . , xn ∈ {±1}, and m constraints, a global cardinality constraint has the form of Σni = 1 xi = (1 − 2p)n, where p ∈ (Ω(1), 1 − Ω(1)) and pn is an integer. Let AV G be the expected ...
The Complexity of Global Cardinality Constraints
LICS '09: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer ScienceIn a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a ...
Comments