A computational proof of complexity of some restricted counting problems (Q534558): 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.tcs.2010.10.039
+Normal rank
@@ Property / OpenAlex ID @@
+W2099255094
@@ Property / OpenAlex ID: W2099255094 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4391229
@@ Property / cites work: Q4391229 / rank @@
+Normal rank
@@ Property / cites work @@
+Towards a dichotomy theorem for the counting constraint satisfaction problem
+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 @@
+Q3549638
@@ Property / cites work: Q3549638 / rank @@
+Normal rank
@@ Property / cites work @@
+A Computational Proof of Complexity of Some Restricted Counting Problems
+Normal rank
@@ Property / cites work @@
+Holant problems and counting CSP
@@ Property / cites work: Holant problems and counting CSP / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079605
@@ Property / cites work: Q4079605 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+On counting homomorphisms to directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Q4521549
@@ Property / cites work: Q4521549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5390002
@@ Property / cites work: Q5390002 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q5807665
@@ Property / cites work: Q5807665 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002474
@@ Property / cites work: Q4002474 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+Quantum Circuits That Can Be Simulated Classically in Polynomial Time
+Normal rank