The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034): Difference between revisions

@@ Property / cites work @@
+Q4501524
@@ Property / cites work: Q4501524 / rank @@
+Normal rank
@@ Property / cites work @@
+Isolation, matching, and counting uniform and nonuniform upper bounds
+Normal rank
@@ Property / cites work @@
+Random pseudo-polynomial algorithms for exact matroid problems
+Normal rank
@@ Property / cites work @@
+On the computation of pfaffians
@@ Property / cites work: On the computation of pfaffians / rank @@
+Normal rank
@@ Property / cites work @@
+On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration
+Normal rank
@@ Property / cites work @@
+Q5605168
@@ Property / cites work: Q5605168 / rank @@
+Normal rank
@@ Property / cites work @@
+Overlapping Pfaffians
@@ Property / cites work: Overlapping Pfaffians / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588717
@@ Property / cites work: Q5588717 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4097310
@@ Property / cites work: Q4097310 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)
+Normal rank
@@ Property / cites work @@
+Q5501853
@@ Property / cites work: Q5501853 / rank @@
+Normal rank
@@ Property / cites work @@
+Flow in Planar Graphs with Multiple Sources and Sinks
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Planarity testing in parallel
@@ Property / cites work: Planarity testing in parallel / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542181
@@ Property / cites work: Q4542181 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036702
@@ Property / cites work: Q4036702 / rank @@
+Normal rank
@@ Property / cites work @@
+NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
+Normal rank