A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices (Q2089763)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices |
scientific article; zbMATH DE number 7606011
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices |
scientific article; zbMATH DE number 7606011 |
Statements
A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices (English)
0 references
24 October 2022
0 references
generic partitioned matrix
0 references
Edmonds' problem
0 references
non-commutative Edmonds' problem
0 references
maximum rank completion problem
0 references
0 references
0 references
0 references
0 references
