The complexity of counting homomorphisms to cactus graphs modulo 2 (Q2828223): Difference between revisions

@@ Property / OpenAlex ID @@
+W2030999876
@@ Property / OpenAlex ID: W2030999876 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0556
@@ Property / arXiv ID: 1307.0556 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for center problems in cactus networks
+Normal rank
@@ Property / cites work @@
+Centdian Computation in Cactus Graphs
@@ Property / cites work: Centdian Computation in Cactus Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of partition functions
@@ Property / cites work: The complexity of partition functions / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Homomorphisms with Complex Values: A Dichotomy Theorem
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+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 @@
+Q4521549
@@ Property / cites work: Q4521549 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of parity graph homomorphism: an initial investigation
+Normal rank
@@ Property / cites work @@
+A Complexity Dichotomy for Partition Functions with Mixed Signs
+Normal rank
@@ Property / cites work @@
+On the construction of parallel computers from various basis of Boolean functions
+Normal rank
@@ Property / cites work @@
+The Complexity of Symmetric Boolean Parity Holant Problems
+Normal rank
@@ Property / cites work @@
+On the Number of Husimi Trees
@@ Property / cites work: On the Number of Husimi Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Operations with structures
@@ Property / cites work: Operations with structures / rank @@
+Normal rank
@@ Property / cites work @@
+Another Proof of Cauchy's Group Theorem
@@ Property / cites work: Another Proof of Cauchy's Group Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+PP is as Hard as the Polynomial-Time Hierarchy
@@ Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank @@
+Normal rank