Pages that link to "Item:Q1630376"

The following pages link to Constructive non-commutative rank computation is in deterministic polynomial time (Q1630376):

Displaying 31 items.

• Wildness for tensors (Q1736243) (← links)
• A compact representation for modular semilattices and its applications (Q2006979) (← links)
• A standard form in (some) free fields: how to construct minimal linear representations (Q2053517) (← links)
• Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) (Q2054204) (← links)
• A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices (Q2061866) (← 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)
• Polystability in positive characteristic and degree lower bounds for invariant rings (Q2102173) (← links)
• Ideals of spaces of degenerate matrices (Q2144235) (← links)
• Information geometry of operator scaling (Q2151570) (← links)
• A cost-scaling algorithm for computing the degree of determinants (Q2159472) (← links)
• Algorithms for orbit closure separation for invariants and semi-invariants of matrices (Q2219886) (← links)
• On a weighted linear matroid intersection algorithm by deg-det computation (Q2227314) (← links)
• Operator scaling: theory and applications (Q2309517) (← links)
• Ranks of linear matrix pencils separate simultaneous similarity orbits (Q2684535) (← links)
• Weighted slice rank and a minimax correspondence to Strassen's spectra (Q2692138) (← 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)
• Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation (Q5001672) (← links)
• Maximum Likelihood Estimation for Matrix Normal Models via Quiver Representations (Q5001673) (← links)
• A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 $$\times $$ 2 Submatrices (Q5041746) (← links)
• A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. (Q5089170) (← links)
• (Q5092460) (← links)
• Maximum likelihood estimation for tensor normal models via castling transforms (Q5093810) (← links)
• Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
• Efficient Black-Box Identity Testing for Free Group Algebras (Q5875516) (← links)
• Connections between graphs and matrix spaces (Q6074039) (← 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)
• A deterministic Algorithm for Harder-Narasimhan filtrations for representations of acyclic quivers (Q6154492) (← links)
• The separating variety for matrix semi-invariants (Q6173931) (← links)
• Harder-Narasimhan filtrations and zigzag persistence (Q6184909) (← links)