The Tutte polynomial modulo a prime (Q1433006): Difference between revisions

@@ Property / cites work @@
+A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
+Normal rank
@@ Property / cites work @@
+Q3856819
@@ Property / cites work: Q3856819 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of the Jones and Tutte polynomials
+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 @@
+The Computational Complexity of Tutte Invariants for Planar Graphs
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of the Tutte Plane: the Bipartite Case
+Normal rank
@@ Property / cites work @@
+Q3140234
@@ Property / cites work: Q3140234 / rank @@
+Normal rank