The following pages link to (Q3467518):
Displaying 13 items.
- Constructive non-commutative rank computation is in deterministic polynomial time (Q1630376) (← links)
- Matrix coefficient realization theory of noncommutative rational functions (Q1703103) (← links)
- A cost-scaling algorithm for computing the degree of determinants (Q2159472) (← 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)
- Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (Q4638110) (← 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 Special Case of Rational Identity Testing and the Brešar-Klep Theorem. (Q5089170) (← links)
- Universality of free random variables: atoms for non-commutative rational functions (Q6126734) (← links)
- Convergence for noncommutative rational functions evaluated in random matrices (Q6144252) (← links)
- Rational Cuntz states peak on the free disk algebra (Q6203679) (← links)
- Algebraic algorithms for fractional linear matroid parity via noncommutative rank (Q6670353) (← links)
