The complexity of complex weighted Boolean \#CSP (Q395011): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2013.07.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1997590411
@@ Property / OpenAlex ID: W1997590411 / 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 @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+Q4521549
@@ Property / cites work: Q4521549 / rank @@
+Normal rank
@@ Property / cites work @@
+On counting homomorphisms to directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A Complexity Dichotomy for Partition Functions with Mixed Signs
+Normal rank
@@ Property / cites work @@
+The Complexity of the Counting Constraint Satisfaction Problem
+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 @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+A dichotomy theorem for constraint satisfaction problems on a 3-element set
+Normal rank
@@ Property / cites work @@
+Holographic Algorithms
@@ Property / cites work: 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 @@
+Computational Complexity of Holant Problems
@@ Property / cites work: Computational Complexity of Holant Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of weighted Boolean \#CSP with mixed signs
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+Graph Homomorphisms with Complex Values: A Dichotomy Theorem
+Normal rank
@@ Property / cites work @@
+On the complexity of #CSP
@@ Property / cites work: On the complexity of #CSP / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of counting CSP with complex weights
@@ Property / cites work: Complexity of counting CSP with complex weights / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113689
@@ Property / cites work: Q3113689 / rank @@
+Normal rank
@@ Property / cites work @@
+From Holant to #CSP and Back: Dichotomy for Holant c Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:395011