Fetching the paper…
Reading the bibliography…
We extend our techniques developed in our earlier paper appeared in Computational Complexity, 2017 (preprint: arXiv:1508.00690) to obtain a deterministic polynomial time algorithm for computing the non-commutative rank together with certificates of linear spaces of matrices over sufficiently large base fields.
Lectures on the Algebraic Theory of Fields
K.G. Ramanathan · 1954
Earlier work this paper cites.
Rational identities and applications to algebra and geometry
S.A Amitsur · 1966
Earlier work this paper cites.
Systems of distinct representatives and linear algebra
Jack Edmonds · 1967
Earlier work this paper cites.
Skew fields of noncommutative rational functions (preliminary version)
George W. Bergman · 1970
Earlier work this paper cites.
Free Rings and Their Relations
P. M. Cohn · 1971
Earlier work this paper cites.
The eigenvalue problem λ T x + S x \lambda Tx+Sx
Kai-Tak Wong · 1974
Earlier work this paper cites.
A prime matrix ideal yields a skew field
Peter Malcolmson · 1978
Earlier work this paper cites.
Primitive spaces of matrices of bounded rank
MD Atkinson and S Lloyd · 1981
Earlier work this paper cites.
Vector spaces of matrices of low rank
David Eisenbud and Joe Harris · 1988
Earlier work this paper cites.
Skew Fields: Theory of General Division Rings
P. M. Cohn · 1995
Earlier work this paper cites.
Computing Cartan subalgebras of Lie algebras
Willem A. de Graaf, Gábor Ivanyos, and Lajos Rónyai · 1996
Cited alongside, same era.
The computational complexity of some problems of linear algebra
Jonathan F. Buss, Gudmund S. Frandsen, and Jeffrey O. Shallit · 1999
Cited alongside, same era.
On the construction of the free field
P. M. Cohn and C. Reutenauer · 1999
Cited alongside, same era.
Semi-invariants of quivers and saturation for littlewood-richardson coefficients
Harm Derksen and Jerzy Weyman · 2000
Cited alongside, same era.
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Nathan Linial, Alex Samorodnitsky, and Avi Wigderson · 2000
Cited alongside, same era.
Polynomial bounds for rings of invariants
Harm Derksen · 2001
Cited alongside, same era.
Derandomizing polynomial identity tests means proving circuit lower bounds
Valentine Kabanets and Russell Impagliazzo · 2004
Later among the works it cites.
The Hilbert null-cone on tuples of matrices and bilinear forms
M. Bürgin and J. Draisma · 2006
Later among the works it cites.
A geometric approach to the Kronecker problem II: rectangular shapes, invariants of matrices and the Artin–Procesi theorem
B. Adsul, S. Nayak, and K. V. Subrahmanyam · 2007
Later among the works it cites.
Tighter connections between derandomization and circuit lower bounds
Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova · 2015
Closest in time.
Non-commutative arithmetic circuits with division
Pavel Hrubeš and Avi Wigderson · 2015
Closest in time.
Generalized wong sequences and their applications to edmonds’ problems
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Semi-invariants of quivers as determinants
M. Domokos and A. N. Zubkov · 2001
Cited alongside, same era.
Semi-invariants of quivers for arbitrary dimension vectors
Aidan Schofield and Michel Van den Bergh · 2001
Cited alongside, same era.
Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank
M. Fortin and C. Reutenauer · 2004
Cited alongside, same era.
Classical complexity and quantum entanglement
Leonid Gurvits · 2004
Cited alongside, same era.
Gábor Ivanyos, Marek Karpinski, Youming Qiao, and Miklos Santha · 2015
Closest in time.
A deterministic polynomial time algorithm for non-commutative rational identity testing
A. Garg, L. Gurvits, R. Oliveira, and A. Wigderson · 2016
Closest in time.
On non-commutative rank and tensor rank
H. Derksen and V. Makam · 2017
Closest in time.
Polynomial degree bounds for matrix semi-invariants
H. Derksen and V. Makam · 2017
Closest in time.
Non-commutative edmonds’ problem and matrix semi-invariants
G. Ivanyos, Y. Qiao, and K.V. Subrahmanyam · 2017
Closest in time.