Inapproximability of the Tutte polynomial (Q937302): Difference between revisions

@@ Property / cites work @@
+Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
+Normal rank
@@ Property / cites work @@
+The Tutte Polynomial Part I: General Theory
@@ Property / cites work: The Tutte Polynomial Part I: General Theory / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+The relative complexity of approximate counting problems
+Normal rank
@@ Property / cites work @@
+Q4521549
@@ Property / cites work: Q4521549 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Several Graph Augmentation Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549645
@@ Property / cites work: Q3549645 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of the Jones and Tutte polynomials
+Normal rank
@@ Property / cites work @@
+Q4798347
@@ Property / cites work: Q4798347 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Approximation Algorithms for the Ising Model
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
+Normal rank
@@ Property / cites work @@
+Hard Enumeration Problems in Geometry and Combinatorics
+Normal rank
@@ Property / cites work @@
+Nowhere-zero 6-flows
@@ Property / cites work: Nowhere-zero 6-flows / rank @@
+Normal rank
@@ Property / cites work @@
+A Contribution to the Theory of Chromatic Polynomials
+Normal rank
@@ Property / cites work @@
+Q3216652
@@ Property / cites work: Q3216652 / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140234
@@ Property / cites work: Q3140234 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomised Approximation in the Tutte Plane
@@ Property / cites work: Randomised Approximation in the Tutte Plane / rank @@
+Normal rank
@@ Property / cites work @@
+On Unapproximable Versions of $NP$-Complete Problems
+Normal rank