Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems

Details Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems

2010-11-22

arxiv.org/abs/1011.4744v1

Computer Science

Computational Complexity

9 pages

Scientific paper

Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are constructed. Following this template, there exist tractable and intractable instances of CSPs. It has been proved that for each CSP problem over a given set of relations there exists a corresponding CSP problem over graphs of unary functions belonging to the same complexity class. In this short note we show a dichotomy theorem for every finite domain D of CSP built upon graphs of homogeneous co-Boolean functions, i.e., unary functions sharing the Boolean range {0, 1}.

Affiliated with

Also associated with

No associations

Rating

Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-657073