Constructing a perfect matching is in random NC (Q1103639): Difference between revisions

@@ Property / cites work @@
+Fast probabilistic algorithms for Hamiltonian circuits and matchings
+Normal rank
@@ Property / cites work @@
+Parallel computation for well-endowed rings and space-bounded probabilistic machines
+Normal rank
@@ Property / cites work @@
+Fast parallel matrix and GCD computations
@@ Property / cites work: Fast parallel matrix and GCD computations / rank @@
+Normal rank
@@ Property / cites work @@
+An overview of computational complexity
@@ Property / cites work: An overview of computational complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Systems of distinct representatives and linear algebra
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+The maximum flow problem is log space complete for P
+Normal rank
@@ Property / cites work @@
+A Las Vegas RNC algorithm for maximum matching
@@ Property / cites work: A Las Vegas RNC algorithm for maximum matching / rank @@
+Normal rank
@@ Property / cites work @@
+Q3732972
@@ Property / cites work: Q3732972 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matchings in general graphs through randomization
+Normal rank
@@ Property / cites work @@
+Fast Probabilistic Algorithms for Verification of Polynomial Identities
+Normal rank
@@ Property / cites work @@
+The Factors of Graphs
@@ Property / cites work: The Factors of Graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02579407
+Normal rank
@@ Property / OpenAlex ID @@
+W2610729871
@@ Property / OpenAlex ID: W2610729871 / rank @@
+Normal rank