On the parallel complexity of discrete relaxation in constraint satisfaction networks

This publication has 9 references indexed in Scilit:

• Constraint satisfaction from a deductive viewpoint
  Artificial Intelligence, 1988
• Parallel consistent labeling algorithms
  International Journal of Parallel Programming, 1987
• The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
  Artificial Intelligence, 1985
• Symbolic reasoning among 3-D models and 2-D images
  Artificial Intelligence, 1981
• Relaxation Applied to Matching Quantitative Relational Structures
  IEEE Transactions on Systems, Man, and Cybernetics, 1980
• The Consistent Labeling Problem: Part I
  IEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
• Consistency in networks of relations
  Artificial Intelligence, 1977
• Complete problems for deterministic polynomial time
  Theoretical Computer Science, 1976
• Scene Labeling by Relaxation Operations
  IEEE Transactions on Systems, Man, and Cybernetics, 1976