The power of propagation: when GAC is enough (Q1701225): Difference between revisions

@@ Property / cites work @@
+Optimization Methods for the Partner Units Problem
+Normal rank
@@ Property / cites work @@
+GAC Via Unit Propagation
@@ Property / cites work: GAC Via Unit Propagation / rank @@
+Normal rank
@@ Property / cites work @@
+On the Desirability of Acyclic Database Schemes
@@ Property / cites work: On the Desirability of Acyclic Database Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Global constraint catalogue: past, present and future
+Normal rank
@@ Property / cites work @@
+The complexity of reasoning with global constraints
+Normal rank
@@ Property / cites work @@
+The complexity of homomorphism and constraint satisfaction problems seen from the other side
+Normal rank
@@ Property / cites work @@
+Classifying the Complexity of Constraints Using Finite Algebras
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2003
+Normal rank
@@ Property / cites work @@
+The complexity of global cardinality constraints
@@ Property / cites work: The complexity of global cardinality constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint satisfaction with succinctly specified relations
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2003
+Normal rank
@@ Property / cites work @@
+Tractable decision for a constraint language implies tractable search
+Normal rank
@@ Property / cites work @@
+A unified theory of structural tractability for constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Constraint satisfaction problems: convexity makes AllDifferent constraints tractable
+Normal rank
@@ Property / cites work @@
+The complexity of completing partial Latin squares
+Normal rank
@@ Property / cites work @@
+Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
+Normal rank
@@ Property / cites work @@
+The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
+Normal rank
@@ Property / cites work @@
+Tree clustering for constraint networks
@@ Property / cites work: Tree clustering for constraint networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4495111
@@ Property / cites work: Q4495111 / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+A Sufficient Condition for Backtrack-Free Search
@@ Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank @@
+Normal rank
@@ Property / cites work @@
+Tractable cases of the extended global cardinality constraint
+Normal rank
@@ Property / cites work @@
+A comparison of structural CSP decomposition methods
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2003
+Normal rank
@@ Property / cites work @@
+Decomposing constraint satisfaction problems using database techniques
+Normal rank
@@ Property / cites work @@
+Closure properties of constraints
@@ Property / cites work: Closure properties of constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Tractable constraints on ordered domains
@@ Property / cites work: Tractable constraints on ordered domains / rank @@
+Normal rank
@@ Property / cites work @@
+Tractable hypergraph properties for constraint satisfaction and conjunctive queries
+Normal rank
@@ Property / cites work @@
+Q3184605
@@ Property / cites work: Q3184605 / rank @@
+Normal rank