A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724): Difference between revisions

@@ Property / cites work @@
+Signature Theory in Holographic Algorithms
@@ Property / cites work: Signature Theory in Holographic Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Holographic algorithms: from art to science
@@ Property / cites work: Holographic algorithms: from art to science / rank @@
+Normal rank
@@ Property / cites work @@
+Holant problems and counting CSP
@@ Property / cites work: Holant problems and counting CSP / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365150
@@ Property / cites work: Q5365150 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+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 @@
+On Counting Independent Sets in Sparse Graphs
@@ Property / cites work: On Counting Independent Sets in Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Approximating Bounded-Degree Boolean #CSP
+Normal rank
@@ Property / cites work @@
+The Complexity of Weighted Boolean #CSP
@@ Property / cites work: The Complexity of Weighted Boolean #CSP / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation trichotomy for Boolean \#CSP
@@ Property / cites work: An approximation trichotomy for Boolean \#CSP / 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 @@
+Q4002474
@@ Property / cites work: Q4002474 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Holographic Algorithms
@@ Property / cites work: Holographic Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+\(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
@@ Property / cites work: \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\) / rank @@
+Normal rank