On the algebraic structure of combinatorial problems
- 1 June 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 200 (1-2) , 185-204
- https://doi.org/10.1016/s0304-3975(97)00230-2
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On binary constraint problemsJournal of the ACM, 1994
- Characterising tractable constraintsArtificial Intelligence, 1994
- Fast parallel constraint satisfactionArtificial Intelligence, 1993
- On the complexity of colouring by superdigraphs of bipartite graphsDiscrete Mathematics, 1992
- On the parallel complexity of discrete relaxation in constraint satisfaction networksArtificial Intelligence, 1990
- Networks of constraints: Fundamental properties and applications to picture processingInformation Sciences, 1974
- Closed systems of functions and predicatesPacific Journal of Mathematics, 1968