A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices
type: Item
instance of: scholarly article
title: A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices
zbMATH Open document ID: 1504.90125
author: Hiroshi Hirai
author: Yuni Iwamasa
published in: Mathematical Programming. Series A. Series B
publication date: 2022-10-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 15A60
zbMATH DE Number: 7606011
zbMATH Keywords: generic partitioned matrix
zbMATH Keywords: Edmonds' problem
zbMATH Keywords: non-commutative Edmonds' problem
zbMATH Keywords: maximum rank completion problem
MaRDI profile type: Publication
full work available at URL: s10107-021-01676-5
OpenAlex ID: W3020014329
cites work: The computational complexity of some problems of linear algebra
cites work: Systems of distinct representatives and linear algebra
cites work: Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank
cites work: Operator scaling: theory and applications
cites work: Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces
cites work: Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
cites work: Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations
cites work: Generalized Wong sequences and their applications to Edmonds' problems
cites work: Non-commutative Edmonds' problem and matrix semi-invariants
cites work: Constructive non-commutative rank computation is in deterministic polynomial time
cites work: A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices
cites work: Derandomizing polynomial identity tests means proving circuit lower bounds
cites work: On the complexity of submodular function minimisation on diamonds
cites work: Q3891767
cites work: Singular spaces of matrices and their application in combinatorics
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: The Factorization of Linear Graphs
DOI: 10.1007/S10107-021-01676-5
description: scientific article; zbMATH DE number 7606011