On Planar Boolean CSP (Q3448805): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-47672-7_35
+Normal rank
@@ Property / OpenAlex ID @@
+W2403828268
@@ Property / OpenAlex ID: W2403828268 / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint Satisfaction Problems of Bounded Width
@@ Property / cites work: Constraint Satisfaction Problems of Bounded Width / rank @@
+Normal rank
@@ Property / cites work @@
+The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
+Normal rank
@@ Property / cites work @@
+A dichotomy theorem for constraint satisfaction problems on a 3-element set
+Normal rank
@@ Property / cites work @@
+Classifying the Complexity of Constraints Using Finite Algebras
+Normal rank
@@ Property / cites work @@
+Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Fanout limitations on constraint systems
@@ Property / cites work: Fanout limitations on constraint systems / 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 @@
+The linear delta-matroid parity problem
@@ Property / cites work: The linear delta-matroid parity problem / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of planar Boolean \#CSP with complex weights
+Normal rank
@@ Property / cites work @@
+Q3821582
@@ Property / cites work: Q3821582 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-weight triangulation is NP-hard
@@ Property / cites work: Minimum-weight triangulation is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank