{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:21:45Z","timestamp":1772641305953,"version":"3.50.1"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T00:00:00Z","timestamp":1557100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10208-019-09417-z","type":"journal-article","created":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T16:01:45Z","timestamp":1557244905000},"page":"223-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Operator Scaling: Theory and Applications"],"prefix":"10.1007","volume":"20","author":[{"given":"Ankit","family":"Garg","sequence":"first","affiliation":[]},{"given":"Leonid","family":"Gurvits","sequence":"additional","affiliation":[]},{"given":"Rafael","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,6]]},"reference":[{"key":"9417_CR1","unstructured":"B.\u00a0Adsul, S.\u00a0Nayak, and K.\u00a0V. Subrahmanyam. A geometric approach to the Kronecker problem ii : rectangular shapes, invariants of n*n matrices, and a generalization of the Artin-Procesi theorem. Manuscript, available at http:\/\/www.cmi.ac.in\/~kv\/ANS10.pdf , 2010."},{"issue":"1\u20132","key":"9417_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"N.\u00a0Alon. Combinatorial Nullstellensatz. Combinatorics, Probability and Computing, 8(1-2):7\u201329, 1999.","journal-title":"Combinatorics, Probability and Computing"},{"key":"9417_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1090\/S0002-9939-1950-0036751-9","volume":"1","author":"SA Amistur","year":"1950","unstructured":"S.\u00a0A. Amistur and J.\u00a0Levitzki. Minimal identities for algebras. Proceedings of the American Mathematical Society, 1:449\u2013463, 1950.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"9417_CR4","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/0021-8693(66)90004-4","volume":"3","author":"S Amitsur","year":"1966","unstructured":"S.\u00a0Amitsur. Rational identities and applications to algebra and geometry. Journal of Algebra, 3:304\u2013359, 1966.","journal-title":"Journal of Algebra"},{"key":"9417_CR5","doi-asserted-by":"crossref","unstructured":"M.\u00a0D. Atkinson. Spaces of matrices with several zero eigenvalues. Bulletin of the London Mathematical Society, 12(89-95), 1980.","DOI":"10.1112\/blms\/12.2.89"},{"key":"9417_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1093\/qmath\/31.3.253","volume":"31","author":"MD Atkinson","year":"1980","unstructured":"M.\u00a0D. Atkinson and S.\u00a0Lloyd. Large spaces of matrices of bounded rank. Quarterly Journal of Math. Oxford, 31:253\u2013262, 1980.","journal-title":"Quarterly Journal of Math. Oxford"},{"key":"9417_CR7","unstructured":"L.\u00a0B. Beasley. Nullspaces of spaces of matrices of bounded rank. Current trends in matrix theory, 1987."},{"issue":"3","key":"9417_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"SJ Berkowitz","year":"1984","unstructured":"S.\u00a0J. Berkowitz. On computing the determinant in small parallel time using a small number of processors. Information Processing Letters, 18(3):147\u2013150, 1984.","journal-title":"Information Processing Letters"},{"key":"9417_CR9","unstructured":"M.\u00a0Bl\u00e4ser, G.\u00a0Jindal, and A.\u00a0Pandey. Greedy strikes again: A deterministic PTAS for commutative rank of matrix spaces. In LIPIcs-Leibniz International Proceedings in Informatics, volume\u00a079. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017."},{"key":"9417_CR10","unstructured":"A.\u00a0Bogdanov and H.\u00a0Wee. More on noncommutative polynomial identity testing. Computational Complexity, pages 92\u201399, 2005."},{"issue":"4","key":"9417_CR11","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1007\/s00209-006-0008-0","volume":"254","author":"M B\u00fcrgin","year":"2006","unstructured":"M.\u00a0B\u00fcrgin and J.\u00a0Draisma. The hilbert null-cone on tuples of matrices and bilinear forms. Math Z, 254(4):785\u2013809, 2006.","journal-title":"Math Z"},{"key":"9417_CR12","doi-asserted-by":"crossref","unstructured":"M.\u00a0Choi. Completely positive linear maps on complex matrices. Linear Algebra and Its Applications, pages 285\u2013290, 1975.","DOI":"10.1016\/0024-3795(75)90075-0"},{"key":"9417_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/plms\/s3-23.2.193","volume":"23","author":"PM Cohn","year":"1971","unstructured":"P.\u00a0M. Cohn. The embedding of firs in skew fields. Proceedings of the London Mathematical Society, 23:193\u2013213, 1971.","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"2","key":"9417_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2307\/2272067","volume":"38","author":"PM Cohn","year":"1973","unstructured":"P.\u00a0M. Cohn. The word problem for free fields. The Journal of Symbolic Logic, 38(2):309\u2013314, 1973.","journal-title":"The Journal of Symbolic Logic"},{"issue":"1","key":"9417_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.2307\/2272273","volume":"40","author":"PM Cohn","year":"1975","unstructured":"P.\u00a0M. Cohn. The word problem for free fields: A correction and an addendum. Journal of Symbolic Logic, 40(1):69\u201374, 1975.","journal-title":"Journal of Symbolic Logic"},{"key":"9417_CR16","doi-asserted-by":"crossref","unstructured":"P.\u00a0M. Cohn. Skew Fields, Theory of General Division Rings. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9781139087193"},{"issue":"3","key":"9417_CR17","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1142\/S0218196799000205","volume":"9","author":"PM Cohn","year":"1999","unstructured":"P.\u00a0M. Cohn and C.\u00a0Reutenauer. On the construction of the free field. International journal of Algebra and Computation, 9(3):307\u2013323, 1999.","journal-title":"International journal of Algebra and Computation"},{"key":"9417_CR18","doi-asserted-by":"crossref","unstructured":"D.\u00a0Cox, J.\u00a0Little, and D.\u00a0O\u2019Shea. Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics. Springer, New York, third edition edition, 2007.","DOI":"10.1007\/978-0-387-35651-8"},{"issue":"4","key":"9417_CR19","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1090\/S0002-9939-00-05698-7","volume":"129","author":"H Derksen","year":"2001","unstructured":"H.\u00a0Derksen. Polynomial bounds for rings of invariants. Proceedings of the American Mathematical Society, 129(4):955\u2013964, 2001.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"9417_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04958-7","volume-title":"Computational Invariant Theory","author":"H Derksen","year":"2002","unstructured":"H.\u00a0Derksen and G.\u00a0Kemper. Computational Invariant Theory, volume 130. Springer-Verlag, Berlin, 2002."},{"key":"9417_CR21","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.aim.2017.01.018","volume":"310","author":"H Derksen","year":"2017","unstructured":"H.\u00a0Derksen and V.\u00a0Makam. Polynomial degree bounds for matrix semi-invariants. Advances in Mathematics, 310:44\u201363, 2017.","journal-title":"Advances in Mathematics"},{"issue":"3","key":"9417_CR22","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1090\/S0894-0347-00-00331-3","volume":"13","author":"H Derksen","year":"2000","unstructured":"H.\u00a0Derksen and J.\u00a0Weyman. Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients. Journal of the American Mathematical Society, 13(3):467\u2013479, 2000.","journal-title":"Journal of the American Mathematical Society"},{"key":"9417_CR23","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/BF02038756","volume":"1","author":"J Dieudonn\u00e9","year":"1949","unstructured":"J.\u00a0Dieudonn\u00e9. Sur une g\u00e9n\u00e9ralisation du groupe orthogonal \u00e0 quatre variables. Arch. Math., 1:282\u2013287, 1949.","journal-title":"Arch. Math."},{"issue":"1","key":"9417_CR24","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01236060","volume":"6","author":"M Domokos","year":"2001","unstructured":"M.\u00a0Domokos and A.\u00a0N. Zubkov. Semi-invariants of quivers as determinants. Transformation Groups, 6(1):9\u201324, 2001.","journal-title":"Transformation Groups"},{"key":"9417_CR25","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Dvir and A.\u00a0Shpilka. Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. SIAM J. Comput, 2006.","DOI":"10.1145\/1060590.1060678"},{"key":"9417_CR26","doi-asserted-by":"crossref","unstructured":"J.\u00a0Edmonds. Systems of distinct representatives and linear algebra. Journal of research of the National Bureau of Standards, 71(241-245), 1967.","DOI":"10.6028\/jres.071B.033"},{"key":"9417_CR27","unstructured":"J.\u00a0Edmonds. Submodular functions, matroids, and certain polyhedra. Lectures, Calgary International Symposium on Combinatorial Structures, 1969."},{"key":"9417_CR28","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0001-8708(88)90054-0","volume":"70","author":"D Eisenbud","year":"1988","unstructured":"D.\u00a0Eisenbud and J.\u00a0Harris. Vector spaces of matrices of low rank. Advances in Math, 70:135\u2013155, 1988.","journal-title":"Advances in Math"},{"key":"9417_CR29","doi-asserted-by":"crossref","unstructured":"S.\u00a0A. Fenner, R.\u00a0Gurjar, and T.\u00a0Thierauf. Bipartite perfect matching is in quasi-NC. STOC, 2016.","DOI":"10.1145\/2897518.2897564"},{"key":"9417_CR30","doi-asserted-by":"crossref","unstructured":"M.\u00a0Forbes and A.\u00a0Shpilka. Explicit noether normalization for simultaneous conjugation via polynomial identity testing. RANDOM, 2013.","DOI":"10.1007\/978-3-642-40328-6_37"},{"key":"9417_CR31","doi-asserted-by":"crossref","unstructured":"M.\u00a0Forbes and A.\u00a0Shpilka. Quasipolynomial-time identity testing of non-commutative and read-once oblivious algebraic branching programs. FOCS, pages 243\u2013252, 2013.","DOI":"10.1109\/FOCS.2013.34"},{"key":"9417_CR32","doi-asserted-by":"crossref","unstructured":"E.\u00a0Formanek. Generating the ring of matrix invariants. Ring Theory, pages 73\u201382, 1986.","DOI":"10.1007\/BFb0076314"},{"key":"9417_CR33","unstructured":"M.\u00a0Fortin and C.\u00a0Reutenauer. Commutative\/noncommutative rank of linear matrices and subspaces of matrices of low rank. 2004."},{"issue":"1","key":"9417_CR34","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s00039-018-0434-2","volume":"28","author":"A Garg","year":"2018","unstructured":"A.\u00a0Garg, L.\u00a0Gurvits, R.\u00a0Oliveira, and A.\u00a0Wigderson. Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling. Geometric and Functional Analysis, 28(1):100\u2013145, 2018.","journal-title":"Geometric and Functional Analysis"},{"issue":"4","key":"9417_CR35","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1006\/eujc.2002.0573","volume":"23","author":"B Gelbord","year":"2002","unstructured":"B.\u00a0Gelbord and R.\u00a0Meshulam. Spaces of singular matrices and matroid parity. European Journal of Combinatorics, 23(4):389\u2013397, 2002.","journal-title":"European Journal of Combinatorics"},{"key":"9417_CR36","unstructured":"I.\u00a0Gelfand, S.\u00a0Gelfand, V.\u00a0Retakh, and R.\u00a0Wilson. Quasideterminants. arXiv:math\/0208146 , 2002."},{"issue":"3","key":"9417_CR37","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.jcss.2004.06.003","volume":"69","author":"L Gurvits","year":"2004","unstructured":"L.\u00a0Gurvits. Classical complexity and quantum entanglement. Journal of Computer and System Sciences, 69(3):448\u2013484, 2004.","journal-title":"Journal of Computer and System Sciences"},{"key":"9417_CR38","doi-asserted-by":"crossref","unstructured":"L.\u00a0Gurvits. Hyperbolic polynomials approach to Van der Waerden\/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications. STOC, pages 417\u2013426, 2006.","DOI":"10.1145\/1132516.1132578"},{"key":"9417_CR39","doi-asserted-by":"crossref","unstructured":"L.\u00a0Gurvits and A.\u00a0Samorodnitsky. A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume. STOC, 2000.","DOI":"10.1145\/335305.335311"},{"key":"9417_CR40","doi-asserted-by":"crossref","unstructured":"L.\u00a0Gurvits and A.\u00a0Samorodnitsky. A deterministic algorithm approximating the mixed discriminant and mixed volume, and a combinatorial corollary. Discrete Computational Geometry, 27(531-550), 2002.","DOI":"10.1007\/s00454-001-0083-2"},{"key":"9417_CR41","unstructured":"L.\u00a0Gurvits and P.\u00a0N. Yianilos. The deflation-inflation method for certain semidefinite programming and maximum determinant completion problems. Technical Report, NECI, 1998."},{"key":"9417_CR42","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF02559591","volume":"105","author":"W Haken","year":"1961","unstructured":"W.\u00a0Haken. Theorie der Normalfl\u00e4chen. Acta Math, 105:245\u2013375, 1961.","journal-title":"Acta Math"},{"key":"9417_CR43","doi-asserted-by":"crossref","unstructured":"G.\u00a0Higman. Units in group rings. PhD thesis, Balliol College, 1940.","DOI":"10.1112\/plms\/s2-46.1.231"},{"key":"9417_CR44","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01444162","volume":"42","author":"D Hilbert","year":"1893","unstructured":"D.\u00a0Hilbert. Uber die vollen Invariantensysteme. Math. Ann., 42:313\u2013370, 1893.","journal-title":"Math. Ann."},{"key":"9417_CR45","doi-asserted-by":"crossref","unstructured":"P.\u00a0Hrubes and A.\u00a0Wigderson. Non-commutative arithmetic circuits with division. ITCS, 2014.","DOI":"10.1145\/2554797.2554805"},{"key":"9417_CR46","doi-asserted-by":"crossref","unstructured":"P.\u00a0Hrubes, A.\u00a0Wigderson, and A.\u00a0Yehudayoff. Relationless completeness and separations. In Computational Complexity (CCC), 2010 IEEE 25th Annual Conference on, pages 280\u2013290. IEEE, 2010.","DOI":"10.1109\/CCC.2010.34"},{"issue":"3","key":"9417_CR47","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1090\/S0894-0347-2011-00694-2","volume":"24","author":"P Hrubes","year":"2011","unstructured":"P.\u00a0Hrubes, A.\u00a0Wigderson, and A.\u00a0Yehudayoff. Non-commutative circuits and the sum-of-squares problem. Journal of the American Mathematical Society, 24(3):871\u2013898, 2011.","journal-title":"Journal of the American Mathematical Society"},{"key":"9417_CR48","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1073\/pnas.35.9.533","volume":"35","author":"L-K Hua","year":"1949","unstructured":"L.-K. Hua. Some properties of a sfield. Proceedings of National Academy of Sciences USA, 35:533\u2013537, 1949.","journal-title":"Proceedings of National Academy of Sciences USA"},{"issue":"2","key":"9417_CR49","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/0208010","volume":"8","author":"L Hyafil","year":"1979","unstructured":"L.\u00a0Hyafil. On the parallel evaluation of multivariate polynomials. SIAM Journal on Computing, 8(2):120\u2013123, 1979.","journal-title":"SIAM Journal on Computing"},{"issue":"7","key":"9417_CR50","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1016\/j.jcss.2015.04.006","volume":"81","author":"G Ivanyos","year":"2015","unstructured":"G.\u00a0Ivanyos, M.\u00a0Karpinski, Y.\u00a0Qiao, and M.\u00a0Santha. Generalized Wong sequences and their applications to Edmonds\u2019 problems. Journal of Computer and System Sciences, 81(7):1373\u20131386, 2015.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"9417_CR51","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s00037-016-0143-x","volume":"26","author":"G Ivanyos","year":"2017","unstructured":"G.\u00a0Ivanyos, Y.\u00a0Qiao, and K.\u00a0Subrahmanyam. Non-commutative Edmonds\u2019 problem and matrix semi-invariants. Computational Complexity, 26(3):717\u2013763, 2017.","journal-title":"Computational Complexity"},{"issue":"4","key":"9417_CR52","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00037-018-0165-7","volume":"27","author":"G Ivanyos","year":"2018","unstructured":"G.\u00a0Ivanyos, Y.\u00a0Qiao, and K.\u00a0V. Subrahmanyam. Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. Computational Complexity, 27(4):561\u2013593, December 2018.","journal-title":"Computational Complexity"},{"key":"9417_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-004-0182-6","volume":"13","author":"V Kabanets","year":"2004","unstructured":"V.\u00a0Kabanets and R.\u00a0Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity, 13:1\u201346, 2004.","journal-title":"Computational Complexity"},{"issue":"1\u20132","key":"9417_CR54","first-page":"49","volume":"23","author":"DS Kaliuzhnyi-Verbovetskyi","year":"2010","unstructured":"D.\u00a0S. Kaliuzhnyi-Verbovetskyi and V.\u00a0Vinnikov. Noncommutative rational functions, their difference-differential calculus and realizations. Multidimensional Systems and Signal Processing, 23(1-2):49\u201377, 2010.","journal-title":"Multidimensional Systems and Signal Processing"},{"key":"9417_CR55","doi-asserted-by":"crossref","unstructured":"N.\u00a0Kayal and N.\u00a0Saxena. Polynomial identity testing for depth 3 circuits. Computational Complexity, 2007.","DOI":"10.1007\/s00037-007-0226-9"},{"issue":"4","key":"9417_CR56","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1093\/qmath\/45.4.515","volume":"45","author":"AD King","year":"1994","unstructured":"A.\u00a0D. King. Moduli of representations of finite dimensional algebras. The Quarterly Journal of Mathematics, 45(4):515\u2013530, 1994.","journal-title":"The Quarterly Journal of Mathematics"},{"key":"9417_CR57","doi-asserted-by":"crossref","unstructured":"A.\u00a0Klivans and D.\u00a0Spielman. Randomness efficient identity testing of multivariate polynomials. In Proceedings of the 33rd Annual STOC, 2001.","DOI":"10.1145\/380752.380801"},{"key":"9417_CR58","unstructured":"H.\u00a0Kraft and C.\u00a0Procesi. Classical invariant theory, a primer. https:\/\/math.unibas.ch\/uploads\/x4epersdb\/files\/primernew.pdf , 1996."},{"key":"9417_CR59","unstructured":"N.\u00a0Limaye, G.\u00a0Malod, and S.\u00a0Srinivasan. Lower bounds for non-commutative skew circuits. In Electronic Colloquium on Computational Complexity (ECCC), volume\u00a022, page\u00a022, 2015."},{"key":"9417_CR60","doi-asserted-by":"crossref","unstructured":"N.\u00a0Linial, A.\u00a0Samorodnitsky, and A.\u00a0Wigderson. A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents. STOC, pages 644\u2013652, 1998.","DOI":"10.1145\/276698.276880"},{"key":"9417_CR61","unstructured":"L.\u00a0Lovasz. On determinants, matchings, and random algorithms. Fundamentals of Computation Theory, pages 565\u2013574, 1979."},{"key":"9417_CR62","unstructured":"L.\u00a0Lovasz. Selecting independent lines from a family of lines in a space. Acta Sci. Math., 42(121-131), 1980."},{"key":"9417_CR63","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02585470","volume":"20","author":"L Lovasz","year":"1989","unstructured":"L.\u00a0Lovasz. Singular spaces of matrices and their application in combinatorics. Bulletin of the Brazilian Mathematical Society, 20:87\u201399, 1989.","journal-title":"Bulletin of the Brazilian Mathematical Society"},{"key":"9417_CR64","doi-asserted-by":"crossref","unstructured":"P.\u00a0Malcolmson. A prime matrix ideal yields a skew field. Journal of the London Mathematical Society, 18(221-233), 1978.","DOI":"10.1112\/jlms\/s2-18.2.221"},{"key":"9417_CR65","doi-asserted-by":"crossref","unstructured":"K.\u00a0Mulmuley. Geometric complexity theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether\u2019s normalization lemma. FOCS, pages 629\u2013638, 2012.","DOI":"10.1109\/FOCS.2012.15"},{"key":"9417_CR66","doi-asserted-by":"crossref","unstructured":"N.\u00a0Nisan. Lower bounds for non-commutative computation. In Proceedings of the twenty-third annual ACM symposium on Theory of computing, pages 410\u2013418. ACM, 1991.","DOI":"10.1145\/103418.103462"},{"issue":"2","key":"9417_CR67","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1070\/IM1982v019n02ABEH001422","volume":"19","author":"VL Popov","year":"1982","unstructured":"V.\u00a0L. Popov. The constructive theory of invariants. Izvestiya: Mathematics, 19(2):359\u2013376, 1982.","journal-title":"Izvestiya: Mathematics"},{"key":"9417_CR68","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/0001-8708(76)90027-X","volume":"19","author":"C Procesi","year":"1976","unstructured":"C.\u00a0Procesi. The invariant theory of nn matrices. Advances in Mathematics, 19:306\u2013381, 1976.","journal-title":"Advances in Mathematics"},{"key":"9417_CR69","doi-asserted-by":"crossref","unstructured":"M.\u00a0O. Rabin. Recursive unsolvability of group theoretic problems. Annals of Mathematics, 67(172-194), 1958.","DOI":"10.2307\/1969933"},{"key":"9417_CR70","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1093\/qmath\/os-13.1.83","volume":"13","author":"R Rado","year":"1942","unstructured":"R.\u00a0Rado. A theorem on independence relations. Quarterly Journal of Math. Oxford, 13:83\u201389, 1942.","journal-title":"Quarterly Journal of Math. Oxford"},{"key":"9417_CR71","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-005-0188-8","volume":"14","author":"R Raz","year":"2005","unstructured":"R.\u00a0Raz and A.\u00a0Shpilka. Deterministic polynomial identity testing in non commutative models. Computational Complexity, 14:1\u201319, 2005.","journal-title":"Computational Complexity"},{"issue":"4","key":"9417_CR72","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1070\/IM1974v008n04ABEH002126","volume":"8","author":"JP Razmyslov","year":"1974","unstructured":"J.\u00a0P. Razmyslov. Trace identities of full matrix algebras over a field of characteristic zero. Mathematics of the USSR-Izvestiya, 8(4):727, 1974.","journal-title":"Mathematics of the USSR-Izvestiya"},{"issue":"1","key":"9417_CR73","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01587940","volume":"2","author":"C Reutenauer","year":"1996","unstructured":"C.\u00a0Reutenauer. Inversion height in free fields. Selecta Mathematica, 2(1):93\u2013109, 1996.","journal-title":"Selecta Mathematica"},{"key":"9417_CR74","volume-title":"Polynomial identities in ring theory","author":"LH Rowen","year":"1980","unstructured":"L.\u00a0H. Rowen. Polynomial identities in ring theory. Academic Press, New York, 1980."},{"key":"9417_CR75","doi-asserted-by":"crossref","unstructured":"S.\u00a0Saraf and I.\u00a0Volkovich. Black-box identity testing of depth 4 multilinear circuits. In Proceedings of the 43rd annual STOC, 2011.","DOI":"10.1145\/1993636.1993693"},{"issue":"1","key":"9417_CR76","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-3577(01)80010-0","volume":"12","author":"A Schofield","year":"2001","unstructured":"A.\u00a0Schofield and M.\u00a0V. den Bergh. Semi-invariants of quivers for arbitrary dimension vectors. Indagationes Mathematicae, 12(1):125\u2013138, 2001.","journal-title":"Indagationes Mathematicae"},{"key":"9417_CR77","doi-asserted-by":"crossref","unstructured":"A.\u00a0Shpilka and A.\u00a0Yehudayoff. Arithmetic Circuits: A Survey of Recent Results and Open Questions, volume\u00a05. NOW, Foundations and Trends in Theoretical Computer Science, 2010.","DOI":"10.1561\/9781601984012"},{"key":"9417_CR78","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1214\/aoms\/1177703591","volume":"35","author":"R Sinkhorn","year":"1964","unstructured":"R.\u00a0Sinkhorn. A relationship between arbitrary positive matrices and doubly stochastic matrices. The Annals of Mathematical Statistics, 35:876\u2013879, 1964.","journal-title":"The Annals of Mathematical Statistics"},{"key":"9417_CR79","first-page":"182","volume":"264","author":"V Strassen","year":"1973","unstructured":"V.\u00a0Strassen. Vermeidung von Divisionen. Journal f\u00fcr Reine Angew. Math, 264:182\u2013202, 1973.","journal-title":"Journal f\u00fcr Reine Angew. Math"},{"key":"9417_CR80","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L Valiant","year":"1979","unstructured":"L.\u00a0Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189\u2013201, 1979.","journal-title":"Theoretical Computer Science"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-019-09417-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-019-09417-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-019-09417-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T13:22:04Z","timestamp":1663420924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-019-09417-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,6]]},"references-count":80,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["9417"],"URL":"https:\/\/doi.org\/10.1007\/s10208-019-09417-z","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,6]]},"assertion":[{"value":"7 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}