The complexity of Boolean functions
The complexity of Boolean functions
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
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)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Fanout limitations on constraint systems
Theoretical Computer Science
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Constraint Satisfaction Problems and Finite Algebras
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Looking for a Version of Schaefer''s Dichotomy Theorem When Each Variable Occurs at Most Twice
Looking for a Version of Schaefer''s Dichotomy Theorem When Each Variable Occurs at Most Twice
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Hi-index | 0.00 |
This paper is a contribution to the general investigation into how the complexity of constraint satisfaction problems (CSPs) is determined by the form of the constraints. Schaefer proved that the Boolean generalized CSP has the dichotomy property (i.e., all instances are either in P or are NP-complete), and gave a complete and simple classification of those instances which are in P (assuming $\mbox{P}\neq\mbox{NP}$) [20]. In this paper we consider a special subcase of the generalized CSP. For this CSP subcase, we require that the variables be drawn from disjoint Boolean domains. Our relation set contains only two elements: a monotone multiple-arity Boolean relation R and its complement $\overline{R}$. We prove a dichotomy theorem for these monotone function CSPs, and characterize those monotone functions such that the corresponding problem resides in P.