Pages that link to "Item:Q1778018"
From MaRDI portal
The following pages link to Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank (Q1778018):
Displaying 24 items.
- Constructive non-commutative rank computation is in deterministic polynomial time (Q1630376) (← links)
- On rank-critical matrix spaces (Q1679671) (← links)
- Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) (Q2054204) (← links)
- A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices (Q2089763) (← links)
- Computing valuations of the Dieudonné determinants (Q2100059) (← links)
- A cost-scaling algorithm for computing the degree of determinants (Q2159472) (← links)
- The \(G\)-stable rank for tensors and the cap set problem (Q2166199) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2353409) (← links)
- Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
- Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces (Q2413447) (← links)
- Weighted slice rank and a minimax correspondence to Strassen's spectra (Q2692138) (← links)
- Linearizing the word problem in (some) free fields (Q4554885) (← links)
- A deterministic PTAS for the commutative rank of matrix spaces (Q4568108) (← links)
- Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (Q4638110) (← links)
- On non-commutative rank and tensor rank (Q4643712) (← links)
- Closure, commutativity and minimal complexity of some spaces of matrices (Q4729914) (← links)
- Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces (Q4959125) (← links)
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)
- A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 $$\times $$ 2 Submatrices (Q5041746) (← links)
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
- A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices (Q6120836) (← links)
- Convex analysis on Hadamard spaces and scaling problems (Q6659497) (← links)
- Algebraic algorithms for fractional linear matroid parity via noncommutative rank (Q6670353) (← links)
