Periodic constraint satisfaction problems: Tractable subclasses (Q816674): Difference between revisions

@@ Property / cites work @@
+Q2754150
@@ Property / cites work: Q2754150 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of maximal constraint languages
@@ Property / cites work: The complexity of maximal constraint languages / rank @@
+Normal rank
@@ Property / cites work @@
+Characterising tractable constraints
@@ Property / cites work: Characterising tractable constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Q4495111
@@ Property / cites work: Q4495111 / rank @@
+Normal rank
@@ Property / cites work @@
+A new tractable class of constraint satisfaction problems
+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 @@
+Q4542577
@@ Property / cites work: Q4542577 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140457
@@ Property / cites work: Q3140457 / rank @@
+Normal rank
@@ Property / cites work @@
+On the algebraic structure of combinatorial problems
+Normal rank
@@ Property / cites work @@
+Constraints, consistency and closure
@@ Property / cites work: Constraints, consistency and closure / rank @@
+Normal rank
@@ Property / cites work @@
+Constraints and universal algebra
@@ Property / cites work: Constraints and universal algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Closure properties of constraints
@@ Property / cites work: Closure properties of constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258576
@@ Property / cites work: Q4258576 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank