Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems - Computer Science > Computational ComplexityReportar como inadecuado




Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems - Computer Science > Computational Complexity - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Constraint Satisfaction Problems CSP constitute a convenient way to capturemany combinatorial problems. The general CSP is known to be NP-complete, butits complexity depends on a template, usually a set of relations, upon whichthey are constructed. Following this template, there exist tractable andintractable instances of CSPs. It has been proved that for each CSP problemover a given set of relations there exists a corresponding CSP problem overgraphs of unary functions belonging to the same complexity class. In this shortnote we show a dichotomy theorem for every finite domain D of CSP built upongraphs of homogeneous co-Boolean functions, i.e., unary functions sharing theBoolean range {0, 1}.



Autor: Florian Richoux

Fuente: https://arxiv.org/







Documentos relacionados