The complexity of computing the Tutte polynomial on transversal matroids (Q1842565): Difference between revisions

@@ Property / reviewed by @@
+Martin Loebl
@@ Property / reviewed by: Martin Loebl / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the Reliability Polynomial for Shellable Independence Systems
+Normal rank
@@ Property / cites work @@
+Exchange systems, matchings, and transversals
@@ Property / cites work: Exchange systems, matchings, and transversals / rank @@
+Normal rank
@@ Property / cites work @@
+Q3728007
@@ Property / cites work: Q3728007 / rank @@
+Normal rank
@@ Property / cites work @@
+Reliable assignments of processors to tasks and factoring on matroids
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic single processor scheduling
@@ Property / cites work: Probabilistic single processor scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of the Jones and Tutte polynomials
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Tutte Invariants for Planar Graphs
+Normal rank
@@ Property / cites work @@
+Bicycle dimension and special points of the Tutte polynomial
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01294456
+Normal rank
@@ Property / OpenAlex ID @@
+W2085669706
@@ Property / OpenAlex ID: W2085669706 / rank @@
+Normal rank