The Computational Complexity of the Tutte Plane: the Bipartite Case (Q4291212): Difference between revisions

@@ Property / author @@
-Dominic J. A. Welsh
@@ Property / author: Dominic J. A. Welsh / rank @@
-Normal rank
@@ Property / author @@
+Dominic J. A. Welsh
@@ Property / author: Dominic J. A. Welsh / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q60265216
@@ Property / Wikidata QID: Q60265216 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Hard Enumeration Problems in Geometry and Combinatorics
+Normal rank
@@ Property / cites work @@
+On the computational complexity of the Jones and Tutte polynomials
+Normal rank
@@ Property / cites work @@
+Q3906715
@@ Property / cites work: Q3906715 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Q3972641
@@ Property / cites work: Q3972641 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/cpc/VertiganW92
@@ Property / DBLP publication ID: journals/cpc/VertiganW92 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4291212