Fine-grained dichotomies for the Tutte plane and Boolean \#CSP (Q1725642): Difference between revisions

@@ Property / describes a project that uses @@
+tutte_bhkk
@@ Property / describes a project that uses: tutte_bhkk / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3021067957
@@ Property / OpenAlex ID: W3021067957 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743447
@@ Property / cites work: Q5743447 / 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 @@
+Computational Complexity of Holant Problems
@@ Property / cites work: Computational Complexity of Holant Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+Block interpolation: a framework for tight exponential-time counting complexity
+Normal rank
@@ Property / cites work @@
+Exponential Time Complexity of the Permanent and the Tutte Polynomial
+Normal rank
@@ Property / cites work @@
+Exponential Time Complexity of the Permanent and the Tutte Polynomial
+Normal rank
@@ Property / cites work @@
+Combinatorics, Complexity, and Chance
@@ Property / cites work: Combinatorics, Complexity, and Chance / rank @@
+Normal rank
@@ Property / cites work @@
+The Exponential Time Complexity of Computing the Probability That a Graph Is Connected
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+On the computational complexity of the Jones and Tutte polynomials
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+Q3416249
@@ Property / cites work: Q3416249 / 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
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank