The parallel complexity of tree embedding problems (extended abstract) (Q5096766): Difference between revisions

@@ Property / cites work @@
+The Parallel Evaluation of General Arithmetic Expressions
+Normal rank
@@ Property / cites work @@
+Nonconstructive tools for proving polynomial-time decidability
+Normal rank
@@ Property / cites work @@
+Parallelism in random access machines
@@ Property / cites work: Parallelism in random access machines / rank @@
+Normal rank
@@ Property / cites work @@
+Subtree isomorphism is in random NC
@@ Property / cites work: Subtree isomorphism is in random NC / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+Constructing a perfect matching is in random NC
@@ Property / cites work: Constructing a perfect matching is in random NC / rank @@
+Normal rank
@@ Property / cites work @@
+Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph
+Normal rank
@@ Property / cites work @@
+Subtree isomorphism is NC reducible to bipartite perfect matching
+Normal rank
@@ Property / cites work @@
+Subtree Isomorphism in O(n5/2)
@@ Property / cites work: Subtree Isomorphism in O(n5/2) / rank @@
+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 @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XV: Giant steps
@@ Property / cites work: Graph minors. XV: Giant steps / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Parallel Biconnectivity Algorithm
@@ Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank @@
+Normal rank