Polynomial-time 1-Turing reductions from #PH to #P
Theoretical Computer Science
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Complexity of generalized satisfiability counting problems
Information and Computation
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Information and Computation
The complexity of minimal satisfiability problems
Information and Computation
A Complete Classification of the Complexity of Propositional Abduction
SIAM Journal on Computing
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Information Processing Letters
Parameterized complexity of constraint satisfaction problems
Computational Complexity
Structure identification of Boolean relations and plain bases for co-clones
Journal of Computer and System Sciences
Information Processing Letters
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The complexity of satisfiability problems: refining Schaefer's theorem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Enumerating all solutions of a boolean CSP by non-decreasing weight
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Complexity of approximating CSP with balance / hard constraints
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
We study the computational complexity of Boolean constraint satisfaction problems with cardinality constraint. A Galois connection between clones and coclones has received a lot of attention in the context of complexity considerations for constraint satisfaction problems. This connection does not seem to help when considering constraint satisfaction problems that support in addition a cardinality constraint. We prove that a similar Galois connection, involving a weaker closure operator and partial polymorphisms, can be applied to such problems. Thus, we establish dichotomies for the decision as well as for the counting problems in Schaefer's framework.