Geodesic
The property of being polynomial for Mal'tsev constraint satisfaction problems
Algebra i logika, Tome 45 (2006) no. 6, pp. 655-686

Voir la notice de l'article provenant de la source Math-Net.Ru

A combinatorial constraint satisfaction problem aims at expressing in unified terms a wide spectrum of problems in various branches of mathematics, computer science, and AI. The generalized satisfiability problem is NP-complete, but many of its restricted versions can be solved in a polynomial time. It is known that the computational complexity of a restricted constraint satisfaction problem depends only on a set of polymorphisms of relations which are admitted to be used in the problem. For the case where a set of such relations is invariant under some Mal'tsev operation, we show that the corresponding constraint satisfaction problem can be solved in a polynomial time. 
@article{AL_2006_45_6_a1,
     author = {A. A. Bulatov},
     title = {The property of being polynomial for {Mal'tsev} constraint satisfaction problems},
     journal = {Algebra i logika},
     pages = {655--686},
     publisher = {mathdoc},
     volume = {45},
     number = {6},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2006_45_6_a1/}
}
TY  - JOUR
AU  - A. A. Bulatov
TI  - The property of being polynomial for Mal'tsev constraint satisfaction problems
JO  - Algebra i logika
PY  - 2006
SP  - 655
EP  - 686
VL  - 45
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2006_45_6_a1/
LA  - ru
ID  - AL_2006_45_6_a1
ER  - 
%0 Journal Article
%A A. A. Bulatov
%T The property of being polynomial for Mal'tsev constraint satisfaction problems
%J Algebra i logika
%D 2006
%P 655-686
%V 45
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2006_45_6_a1/
%G ru
%F AL_2006_45_6_a1
A. A. Bulatov. The property of being polynomial for Mal'tsev constraint satisfaction problems. Algebra i logika, Tome 45 (2006) no. 6, pp. 655-686. http://geodesic.mathdoc.fr/item/AL_2006_45_6_a1/