Fetching the paper…
Reading the bibliography…
In 1967, Edmonds introduced the problem of computing the rank over the rational function field of an $n\times n$ matrix $T$ with integral homogeneous linear polynomials.
E. Witt, Zyklische körper und algebren der charakteristik p vom grad pn. struktur diskret bewerteter perfekter körper mit vollkommenem restklassenkörper der charakteristik p , J. Reine Angew. Math, 176
1937
Earlier work this paper cites.
T. G. Room, The geometry of determinantal loci , The Cambridge University Press, 1938
1938
Earlier work this paper cites.
W. T. Tutte, The factorization of linear graphs , Journal of the London Mathematical Society 1
1947
Earlier work this paper cites.
S.A Amitsur, Rational identities and applications to algebra and geometry , Journal of Algebra 3
1966
Earlier work this paper cites.
Jack Edmonds, Systems of distinct representatives and linear algebra , J. Res. Nat. Bur. Standards Sect. B 71
1967
Earlier work this paper cites.
George W. Bergman, Skew fields of noncommutative rational functions (preliminary version) , Séminaire Schützenberger 1
1970
Earlier work this paper cites.
P. M. Cohn, The word problem for free fields , J. Symbolic Logic 38
1973
Earlier work this paper cites.
Ju. P. Razmyslov, Trace identities of full matrix algebras over a field of characteristic zero , Mathematics of the USSR-Izvestiya 8
1974
Earlier work this paper cites.
Kai-Tak Wong, The eigenvalue problem λ T x + S x \lambda Tx+Sx , Journal of Differential Equations 16
1974
Earlier work this paper cites.
C. Procesi, The invariant theory of n × n n\times n matrices , Advances in Mathematics 19
1976
Earlier work this paper cites.
Peter Malcolmson, A prime matrix ideal yields a skew field , Journal of the London Mathematical Society s2-18
1978
Earlier work this paper cites.
MD Atkinson and S Lloyd, Primitive spaces of matrices of bounded rank , Journal of the Australian Mathematical Society (Series A) 30
1981
Earlier work this paper cites.
Vladimir L Popov, The constructive theory of invariants , Izvestiya: Mathematics 19
1982
Earlier work this paper cites.
Edward Formanek, Generating the ring of matrix invariants , Ring Theory (Freddy M. J. van Oystaeyen, ed.), Lecture Notes in Mathematics, vol. 1197, Springer Berlin Heidelberg, 1986, pp. 73–82 (English)
1986
Earlier work this paper cites.
Ketan Mulmuley, A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , Combinatorica 7
1987
Earlier work this paper cites.
David Eisenbud and Joe Harris, Vector spaces of matrices of low rank , Advances in Mathematics 70
1988
Earlier work this paper cites.
László Lovász, Singular spaces of matrices and their application in combinatorics , Boletim da Sociedade Brasileira de Matemática-Bulletin/Brazilian Mathematical Society 20
1989
Earlier work this paper cites.
T.Y. Lam, A first course in noncommutative rings , Graduate Texts in Mathematics, Springer, 1991
1991
Earlier work this paper cites.
Stephen Donkin, Invariants of several matrices , Inventiones mathematicae 110
1992
Earlier work this paper cites.
Erich Kaltofen, On computing determinants of matrices without divisions , Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, ISSAC ’92, Berkeley, CA, USA, July 27-29, 1992, 1992, pp. 342–349
1992
Earlier work this paper cites.
Stephen Donkin, Invariant functions on matrices , Mathematical Proceedings of the Cambridge Philosophical Society 113
1993
Cited alongside, same era.
Willem A. de Graaf, Gábor Ivanyos, and Lajos Rónyai, Computing Cartan subalgebras of Lie algebras , Applicable Algebra in Engineering, Communication and Computing 7
1996
Cited alongside, same era.
Alexander L. Chistov, Gábor Ivanyos, and Marek Karpinski, Polynomial time algorithms for modules over finite dimensional algebras , ISSAC, 1997, pp. 68–74
1997
Cited alongside, same era.
Ajeh M Cohen, Gábor Ivanyos, and David B Wales, Finding the radical of an algebra of linear transformations , Journal of Pure and Applied Algebra 117
1997
Cited alongside, same era.
Meena Mahajan and V. Vinay, Determinant: Combinatorics, algorithms, and complexity , Chicago Journal of Theoretical Computer Science 1997
1997
M. Fortin and C. Reutenauer, Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank , Séminaire Lotharingien de Combinatoire 52
2004
Later among the works it cites.
Leonid Gurvits, Classical complexity and quantum entanglement , J. Comput. Syst. Sci. 69
2004
Later among the works it cites.
Valentine Kabanets and Russell Impagliazzo, Derandomizing polynomial identity tests means proving circuit lower bounds , Computational Complexity 13
2004
Later among the works it cites.
James Geelen and Satoru Iwata, Matroid matching via mixed skew-symmetric matrices , Combinatorica 25
2005
Later among the works it cites.
Nicholas J. A. Harvey, David R. Karger, and Kazuo Murota, Deterministic network coding by matrix completion , Proceedings of SODA, ACM-SIAM, 2005, pp. 489–498
2005
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Leonid Gurvits and Peter N. Yianilos, The deflation-inflation method for certain semidefinite programming and maximum determinant completion problems (extended abstract) , Tech. report, NECI, 1998
1998
Cited alongside, same era.
Jonathan F. Buss, Gudmund S. Frandsen, and Jeffrey O. Shallit, The computational complexity of some problems of linear algebra , J. Comput. Syst. Sci. 58
1999
Cited alongside, same era.
P. M. Cohn and C. Reutenauer, On the construction of the free field , International Journal of Algebra and Computation 9
1999
Cited alongside, same era.
James F. Geelen, Maximum rank matrix completion , Linear Algebra and its Applications 288
1999
Cited alongside, same era.
Harm Derksen and Jerzy Weyman, Semi-invariants of quivers and saturation for littlewood-richardson coefficients , Journal of the American Mathematical Society 13
2000
Cited alongside, same era.
M. Domokos, Poincaré series of semi-invariants of 2 × \times 2 matrices , Linear Algebra and its Applications 310
2000
Cited alongside, same era.
James F Geelen, An algebraic matching algorithm , Combinatorica 20
2000
Cited alongside, same era.
M. Bürgin and J. Draisma, The Hilbert null-cone on tuples of matrices and bilinear forms , Mathematische Zeitschrift 254
2006
Later among the works it cites.
B. Adsul, S. Nayak, and K. V. Subrahmanyam, A geometric approach to the Kronecker problem II: rectangular shapes, invariants of matrices and the Artin–Procesi theorem , preprint, 2007
2007
Later among the works it cites.
Bharat Adsul and K. V. Subrahmanyam, A geometric approach to the Kronecker problem I: the two row case , Proceedings Mathematical Sciences 118
2008
Later among the works it cites.
Peter A. Brooksbank and Eugene M. Luks, Testing isomorphism of modules , Journal of Algebra 320
2008
Later among the works it cites.
Gábor Ivanyos, Marek Karpinski, and Nitin Saxena, Deterministic polynomial time algorithms for matrix completion problems , SIAM J. Comput. 39
2010
Later among the works it cites.
Laurent Manivel, A note on certain Kronecker coefficients , Proceedings of the American Mathematical Society 138
2010
Later among the works it cites.
Peter Bürgisser, J. M. Landsberg, Laurent Manivel, and Jerzy Weyman, An overview of mathematical issues arising in the geometric complexity theory approach to VP ≠ \not= VNP , SIAM J. Comput. 40
2011
Later among the works it cites.
Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova, Tighter connections between derandomization and circuit lower bounds , Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, 2015, pp. 645–658
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
Pavel Hrubeš and Avi Wigderson, Non-commutative arithmetic circuits with division , Theory of Computing 11
2015
Closest in time.
Gábor Ivanyos, Marek Karpinski, Youming Qiao, and Miklos Santha, Generalized wong sequences and their applications to edmonds’ problems , J. Comput. Syst. Sci. 81
2015
Closest in time.
2015
Closest in time.
M. Domokos and V. Drensky, Defining relation for semi-invariants of three by three matrix triples , Journal of Pure and Applied Algebra 216
2098
Closest in time.