Linear matroid intersection is in quasi-NC (Q2027206): Difference between revisions

@@ Property / cites work @@
+FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+On computing the determinant in small parallel time using a small number of processors
+Normal rank
@@ Property / cites work @@
+Parallel computation for well-endowed rings and space-bounded probabilistic machines
+Normal rank
@@ Property / cites work @@
+A probabilistic remark on algebraic program testing
+Normal rank
@@ Property / cites work @@
+Systems of distinct representatives and linear algebra
+Normal rank
@@ Property / cites work @@
+Q5593828
@@ Property / cites work: Q5593828 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid Intersection
@@ Property / cites work: Matroid Intersection / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite perfect matching is in quasi-NC
@@ Property / cites work: Bipartite perfect matching is in quasi-NC / rank @@
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Maximum rank matrix completion
@@ Property / cites work: Maximum rank matrix completion / rank @@
+Normal rank
@@ Property / cites work @@
+Linear matroid intersection is in quasi-NC
@@ Property / cites work: Linear matroid intersection is in quasi-NC / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Polynomial Time Algorithms for Matrix Completion Problems
+Normal rank
@@ Property / cites work @@
+Derandomizing polynomial identity tests means proving circuit lower bounds
+Normal rank
@@ Property / cites work @@
+The complexity of parallel search
@@ Property / cites work: The complexity of parallel search / rank @@
+Normal rank
@@ Property / cites work @@
+Singular spaces of matrices and their application in combinatorics
+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 @@
+Q4281309
@@ Property / cites work: Q4281309 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+Fast Probabilistic Algorithms for Verification of Polynomial Identities
+Normal rank
@@ Property / cites work @@
+Fast Parallel Computation of Polynomials Using Few Processors
+Normal rank
@@ Property / cites work @@
+Q3851616
@@ Property / cites work: Q3851616 / rank @@
+Normal rank