Voir la notice de l'article provenant de la source Math-Net.Ru
@article{AL_2005_44_1_a6, author = {E. S. Skvortsov}, title = {Amalgams of {Clones}}, journal = {Algebra i logika}, pages = {97--113}, publisher = {mathdoc}, volume = {44}, number = {1}, year = {2005}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/AL_2005_44_1_a6/} }
E. S. Skvortsov. Amalgams of Clones. Algebra i logika, Tome 44 (2005) no. 1, pp. 97-113. http://geodesic.mathdoc.fr/item/AL_2005_44_1_a6/
[1] U. Montanari, “Networks of constraints: fundamental properties and applications to picture processing”, Inform. Sciences, 7 (1974), 95–132 | DOI | MR | Zbl
[2] T. J. Schaefer, “The complexity of satisfiability problems”, Proc. 10th ACM Symp. Theory Comput. (STOC'78), 1978, 16–226 | MR
[3] A. A. Bulatov, A. A. Krokhin, P. G. Jeavons, “Constraint satisfaction problems and finite algebras”, Automata, Languages and Programming, 27th Intern. Colloq., ICALP 2000, Lect. Notes Comput. Sci., 1853, eds. U. Montanari et al., 2000, 272–282 | MR | Zbl
[4] P. G. Jeavons, “On the algebraic structure of combinatorial problems”, Theor. Comput. Sci., 200:1–2 (1998), 185–204 | DOI | MR | Zbl
[5] R. Pöschel, L. A. Kaluznin, Funktionen- und Relationenalgebren, DVW, Berlin, 1979 | MR
[6] D. Cohen, P. Jeavons, R. Gault, “New tractable classes from old”, CP 2000. 6th intern. conf. (Singapore, Sept. 18-21, 2000), Lect. Notes Comput. Sci., 1894, Springer, Berlin, 2000, 160–171 | Zbl
[7] D. A. Cohen, P. G. Jeavons, M. Koubarakis, Tractable disjunctive constraints, Lect. Notes Comput. Sci., 1330), 1997
[8] D. Cohen, P. Jeavons, M. Koubarakis, “Building tractable disjunctive constraints”, J. ACM, 2000, no. 4, 826–853 | DOI | MR
[9] A. Bulatov, E. Skvortsov, Amalgamy kombinatornykh zadach, Rossiiskaya konf. “Diskretnyi analiz i issledovanie operatsii”, Novosibirsk, 2002