Title :
Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems
Author :
Richoux, Florian
Author_Institution :
Japanese-French Lab. for Inf., Univ. of Tokyo, Tokyo, Japan
Abstract :
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 in D.
Keywords :
Boolean functions; computational complexity; constraint theory; operations research; CSP; dichotomy theorem; homogeneous coBoolean constraint satisfaction problem complexity; homogeneous coBoolean functions; Algebra; Biology; Complexity theory; Computer science; Equations; Informatics; Mathematical model;
Conference_Titel :
Circuits, Communications and System (PACCS), 2011 Third Pacific-Asia Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4577-0855-8
DOI :
10.1109/PACCS.2011.5990156
