Constructive non-commutative rank computation is in deterministic polynomial time
From MaRDI portal
Recommendations
Cites work
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- Arithmetic circuits: a survey of recent results and open questions
- Classical complexity and quantum entanglement
- Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank
- Computing Cartan subalgebras of Lie algebras
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Generalized Wong sequences and their applications to Edmonds' problems
- scientific article; zbMATH DE number 3823989 (Why is no real title available?)
- scientific article; zbMATH DE number 3741566 (Why is no real title available?)
- scientific article; zbMATH DE number 798609 (Why is no real title available?)
- Non-commutative arithmetic circuits with division
- Non-commutative Edmonds' problem and matrix semi-invariants
- On non-commutative rank and tensor rank
- ON THE CONSTRUCTION OF THE FREE FIELD
- Polynomial bounds for rings of invariants
- Polynomial degree bounds for matrix semi-invariants
- Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients
- Semi-invariants of quivers as determinants
- Semi-invariants of quivers for arbitrary dimension vectors
- Singular spaces of matrices and their application in combinatorics
- SMALL MAXIMAL SPACES OF NON-INVERTIBLE MATRICES
- Systems of distinct representatives and linear algebra
- THE CONSTRUCTIVE THEORY OF INVARIANTS
- The eigenvalue problem \(\lambda Tx+Sx\)
- The Hilbert null-cone on tuples of matrices and bilinear forms
- The word problem for free fields
- The word problem for free fields: a correction and an addendum
- Tighter connections between derandomization and circuit lower bounds
- Vector spaces of matrices of low rank
Cited in
(15)- Constructive non-commutative rank computation is in deterministic polynomial time
- On rank-critical matrix spaces
- Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank
- A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 2 submatrices
- General linear group action on tensors: a candidate for post-quantum cryptography
- An exponential lower bound for the degrees of invariants of cubic forms and tensor actions
- Non-commutative Edmonds' problem and matrix semi-invariants
- Simultaneous robust subspace recovery and semi-stability of quiver representations
- A deterministic PTAS for the commutative rank of matrix spaces
- Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
- Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces
- A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices
- The regularity lemma is false over small fields
- Optimization, complexity and invariant theory (invited talk)
- Derandomization and absolute reconstruction for sums of powers of linear forms
This page was built for publication: Constructive non-commutative rank computation is in deterministic polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638110)
