On the algebraic structure of combinatorial problems

Theoretical Computer Science

Volumn 200, Issue 1-2, 1998, Pages 185-204

  Jeavons, Peter ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Closure; Complexity; Homomorphism; Relational structure; Satisfiability

Indexed keywords

EID: 0001110897     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00230-2     Document Type: Article

References (16)

1. J. Bang-Jensen, P. Hell, G. MacGillivray, On the complexity of colouring by superdigraphs of bipartite graphs, Discrete Math. 109 (1992) 27-44.
2. P.M. Cohn, Universal Algebra, Harper & Row, New York, 1965.
3. M.C. Cooper, D.A. Cohen, P.G. Jeavons, Characterizing tractable constraints, Artificial Intelligence 65 (1994) 347-361.
4. M.R. Garey, D.S. Johnson, Computers and intractability: a Guide to NP-Completeness, Freeman, San Francisco, CA, 1979.
5. D. Geiger, Closed systems of functions and predicates, Pacific J. Math. 27 (1968) 95-100.
6. P.G. Jeavons, D.A. Cohen, M. Gyssens, A unifying framework for tractable constraints, U. Montanari, F. Rossi (Eds.), Constraint Programming CP'95, Lecture Notes in Computer Science, vol. 976, 1995, pp. 276-291.
7. P. Jeavons, D. Cohen, An algebraic characterization of tractable constraints, D.-Z. Du, M. Li (Eds.), Computing and Combinatorics COCOON '95, Lecture Notes in Computer Science, vol. 959, 1995, pp. 633-642.
8. S. Kasif, On the parallel complexity of discrete relaxation in constraint satisfaction networks, Artificial Intell. 45 (1990) 275-286.
9. L. Kirousis, Fast parallel constraint satisfaction, Artificial Intell. 64 (1993) 147-160.
10. P.B. Ladkin, R.D. Maddux, On binary constraint problems, J. ACM 41 (1994) 435-469.
11. R.N. McKenzie, G.F. McNulty, W.F. Taylor, Algebras, Lattices and Varieties, Vol. I, Wadsworth and Brooks, California, 1987.
12. U. Montanari, Networks of constraints: fundamental properties and applications to picture processing, Inform. Sci. 7 (1974) 95-132.
13. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
14. I.G. Rosenberg, Minimal clones I: the five types, in: Lectures in Universal Algebra (Proc. Conf. Szeged 1983), Colloq. Math. Soc. Janos Bolyai 43, North-Holland, Amsterdam, 1986, pp. 405-427.
15. T.J. Schaefer, The complexity of satisfiability problems, Proc. 10th ACM Symp. on Theory of Computing (STOC), 1978, pp. 216-226.
16. A. Szendrei, Clones in Universal Algebra, Seminaires de Mathematiques Superieures 99, University of Montreal, 1986.