Result: The complexity of equality constraint languages
Title:
The complexity of equality constraint languages
Authors:
Source:
Computer science (theory and applications)0CSR 2006. :114-126
Publisher Information:
Berlin: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 17 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Complexité calcul, Computational complexity, Complejidad computación, Contrainte égalité, Equality constraint, Constreñimiento igualdad, Groupe automorphisme, Automorphism group, Grupo automorfismo, Logique booléenne, Boolean logic, Lógica booleana, Méthode algébrique, Algebraic method, Método algebraico, Polymorphisme, Polymorphism, Polimorfismo, Problème NP complet, NP complete problem, Problema NP completo, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Algorithms and Complexity Department, Humboldt University, Berlin, Germany
Department of Applied Mathematics, Charles University, Prague, Czech Republic
Department of Applied Mathematics, Charles University, Prague, Czech Republic
ISSN:
0302-9743
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19150240
Database:
PASCAL Archive
Further Information
We apply the algebraic approach to infinite-valued constraint satisfaction to classify the computational complexity of all constraint satisfaction problems with templates that have a highly transitive automorphism group. A relational structure has such an automorphism group if and only if all the constraint types are Boolean combinations of the equality relation, and we call the corresponding constraint languages equality constraint languages. We show that an equality constraint language is tractable if it admits a constant unary or an injective binary polymorphism, and is NP-complete otherwise.