{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:55:13Z","timestamp":1777100113847,"version":"3.51.4"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T00:00:00Z","timestamp":1471564800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00037-016-0143-x","type":"journal-article","created":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T08:15:44Z","timestamp":1471594544000},"page":"717-763","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Non-commutative Edmonds\u2019 problem and matrix semi-invariants"],"prefix":"10.1007","volume":"26","author":[{"given":"G\u00e1bor","family":"Ivanyos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youming","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. V.","family":"Subrahmanyam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,19]]},"reference":[{"key":"143_CR1","unstructured":"B. Adsul, S. Nayak & K. V. Subrahmanyam (2007). A geometric approach to the Kronecker problem II: rectangular shapes, invariants of matrices and the Artin\u2013Procesi theorem. Preprint."},{"issue":"2","key":"143_CR2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s12044-008-0014-8","volume":"118","author":"Bharat Adsul","year":"2008","unstructured":"Adsul Bharat, Subrahmanyam K.V. (2008) A geometric approach to the Kronecker problem I: the two row case. Proceedings Mathematical Sciences 118(2): 213\u2013226","journal-title":"Proceedings Mathematical Sciences"},{"key":"143_CR3","doi-asserted-by":"crossref","unstructured":"S.A Amitsur (1966). Rational identities and applications to algebra and geometry. Journal of Algebra 3(3), 304 \u2013 359. ISSN 0021-8693. URL http:\/\/www.sciencedirect.com\/science\/article\/pii\/0021869366900044 .","DOI":"10.1016\/0021-8693(66)90004-4"},{"key":"143_CR4","doi-asserted-by":"crossref","unstructured":"MD Atkinson & S Lloyd (1981). Primitive spaces of matrices of bounded rank. Journal of the Australian Mathematical Society (Series A) 30(04), 473\u2013482.","DOI":"10.1017\/S144678870001795X"},{"key":"143_CR5","unstructured":"George W. Bergman (1969\u20131970). Skew fields of noncommutative rational functions (preliminary version). S\u00e9minaire Sch\u00fctzenberger 1, 1\u201318. URL http:\/\/eudml.org\/doc\/112813 ."},{"issue":"11","key":"143_CR6","doi-asserted-by":"crossref","first-page":"4020","DOI":"10.1016\/j.jalgebra.2008.07.014","volume":"320","author":"Brooksbank Peter A.","year":"2008","unstructured":"Peter A. Brooksbank, Eugene M. Luks (2008) Testing isomorphism of modules. Journal of Algebra 320(11): 4020\u20134029","journal-title":"Journal of Algebra"},{"issue":"4","key":"143_CR7","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1007\/s00209-006-0008-0","volume":"254","author":"M. B\u00fcrgin","year":"2006","unstructured":"B\u00fcrgin M., Draisma J. (2006) The Hilbert null-cone on tuples of matrices and bilinear forms. Mathematische Zeitschrift 254(4): 785\u2013809","journal-title":"Mathematische Zeitschrift"},{"key":"143_CR8","doi-asserted-by":"publisher","unstructured":"Peter B\u00fcrgisser, J. M. Landsberg, Laurent Manivel & Jerzy Weyman (2011). An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $${VP \\neq VNP}$$ VP \u2260 VNP . SIAM J. Comput. 40(4), 1179\u20131209. doi: 10.1137\/090765328 .","DOI":"10.1137\/090765328"},{"issue":"3","key":"143_CR9","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1006\/jcss.1998.1608","volume":"58","author":"Jonathan F. Buss","year":"1999","unstructured":"Buss Jonathan F., Frandsen Gudmund S., Shallit Jeffrey O. (1999) The computational complexity of some problems of linear algebra. J. Comput. Syst. Sci. 58(3): 572\u2013596","journal-title":"J. Comput. Syst. Sci."},{"key":"143_CR10","doi-asserted-by":"publisher","unstructured":"Marco Carmosino, Russell Impagliazzo, Valentine Kabanets & Antonina Kolokolova (2015). Tighter Connections between Derandomization and Circuit Lower Bounds. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2015, August 24\u201326, 2015, Princeton, NJ, USA, 645\u2013658. doi: 10.4230\/LIPIcs.APPROX-RANDOM.2015.645 .","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2015.645"},{"key":"143_CR11","doi-asserted-by":"crossref","unstructured":"Alexander L. Chistov, G\u00e1bor Ivanyos & Marek Karpinski (1997). Polynomial Time Algorithms for Modules over Finite Dimensional Algebras. In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, ISSAC \u201997, Maui, Hawaii, USA, July 21\u201323, 1997, 68\u201374.","DOI":"10.1145\/258726.258751"},{"key":"143_CR12","doi-asserted-by":"crossref","unstructured":"Ajeh M Cohen, G\u00e1bor Ivanyos & David B Wales (1997). Finding the radical of an algebra of linear transformations. Journal of Pure and Applied Algebra 117, 177\u2013193.","DOI":"10.1016\/S0022-4049(97)00010-8"},{"key":"143_CR13","doi-asserted-by":"crossref","unstructured":"P. M. Cohn (1973). The Word Problem for Free Fields. J. Symbolic Logic 38(2), 309\u2013314. URL http:\/\/projecteuclid.org\/euclid.jsl\/1183738636 .","DOI":"10.2307\/2272067"},{"key":"143_CR14","doi-asserted-by":"crossref","unstructured":"P. M. Cohn (1975). The Word Problem for Free Fields: A Correction and an Addendum. J. Symbolic Logic 40(1), 69\u201374. URL http:\/\/projecteuclid.org\/euclid.jsl\/1183739310 .","DOI":"10.2307\/2272273"},{"key":"143_CR15","unstructured":"P. M. Cohn (1985). Free Rings and Their Relations. L.M.S. Monographs. Acad. Press. ISBN 9780121791506. URL http:\/\/books.google.com.au\/books?id=R3KmAAAAIAAJ . First edition 1971."},{"key":"143_CR16","doi-asserted-by":"crossref","unstructured":"P. M. Cohn (1995). Skew Fields: Theory of General Division Rings. Encyclopedia of Mathematics and its Applications. Cambridge University Press. ISBN 9780521432177. URL http:\/\/books.google.com.au\/books?id=u-4ADgUgpSMC .","DOI":"10.1017\/CBO9781139087193"},{"issue":"3-4","key":"143_CR17","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1142\/S0218196799000205","volume":"9","author":"P.M. Cohn","year":"1999","unstructured":"Cohn P.M., Reutenauer C. (1999) On the construction of the free field. International Journal of Algebra and Computation 9(3-4): 307\u2013323","journal-title":"International Journal of Algebra and Computation"},{"issue":"4","key":"143_CR18","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1090\/S0002-9939-00-05698-7","volume":"129","author":"Derksen Harm","year":"2001","unstructured":"Harm Derksen (2001) Polynomial bounds for rings of invariants. Proceedings of the American Mathematical Society 129(4): 955\u2013964","journal-title":"Proceedings of the American Mathematical Society"},{"key":"143_CR19","unstructured":"Harm Derksen & Visu Makam (2015). Polynomial degree bounds for matrix semi-invariants. Preprint arXiv:1512.03393 ."},{"issue":"3","key":"143_CR20","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1090\/S0894-0347-00-00331-3","volume":"13","author":"Harm Derksen","year":"2000","unstructured":"Derksen Harm, Weyman Jerzy (2000) Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients. Journal of the American Mathematical Society 13(3): 467\u2013479","journal-title":"Journal of the American Mathematical Society"},{"key":"143_CR21","doi-asserted-by":"crossref","unstructured":"M. Domokos, (2000a). Poincar\u00e9 series of semi-invariants of 2 $${\\times}$$ \u00d7 2 matrices. Linear Algebra and its Applications 310(1), 183\u2013194.","DOI":"10.1016\/S0024-3795(00)00070-7"},{"key":"143_CR22","doi-asserted-by":"crossref","unstructured":"M. Domokos (2000b). Relative invariants of 3 \u00d7\u00a0 3 matrix triples. Linear and Multilinear Algebra 47(2), 175\u2013190.","DOI":"10.1080\/03081080008818641"},{"issue":"2","key":"143_CR23","first-page":"175","volume":"13","author":"M. Domokos","year":"2002","unstructured":"Domokos M. (2002) Finite generating system of matrix invariants. Math. Pannon 13(2): 175\u2013181","journal-title":"Math. Pannon"},{"issue":"10","key":"143_CR24","doi-asserted-by":"crossref","first-page":"2098","DOI":"10.1016\/j.jpaa.2012.01.017","volume":"216","author":"M. Domokos","year":"2012","unstructured":"Domokos M., Drensky V. (2012) Defining relation for semi-invariants of three by three matrix triples. Journal of Pure and Applied Algebra 216(10): 2098\u20132105","journal-title":"Journal of Pure and Applied Algebra"},{"issue":"1","key":"143_CR25","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0022-4049(02)00117-2","volume":"176","author":"M. Domokos","year":"2002","unstructured":"Domokos M., Kuzmin S.G., Zubkov A.N. (2002) Rings of matrix invariants in positive characteristic. Journal of Pure and Applied Algebra 176(1): 61\u201380","journal-title":"Journal of Pure and Applied Algebra"},{"issue":"1","key":"143_CR26","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01236060","volume":"6","author":"M. Domokos","year":"2001","unstructured":"Domokos M., Zubkov A.N. (2001) Semi-invariants of quivers as determinants. Transformation groups 6(1): 9\u201324","journal-title":"Transformation groups"},{"issue":"1","key":"143_CR27","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF01231338","volume":"110","author":"Stephen Donkin","year":"1992","unstructured":"Donkin Stephen (1992) Invariants of several matrices. Inventiones mathematicae 110(1): 389\u2013401","journal-title":"Inventiones mathematicae"},{"key":"143_CR28","doi-asserted-by":"crossref","unstructured":"Stephen Donkin (1993). Invariant functions on matrices. Mathematical Proceedings of the Cambridge Philosophical Society 113, 23\u201343. ISSN 1469-8064. URL http:\/\/journals.cambridge.org\/article_S0305004100075757 .","DOI":"10.1017\/S0305004100075757"},{"key":"143_CR29","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71","author":"Jack Edmonds","year":"1967","unstructured":"Edmonds Jack (1967) Systems of distinct representatives and linear algebra. J. Res. Nat. Bur. Standards Sect. B 71: 241\u2013245","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"143_CR30","doi-asserted-by":"crossref","unstructured":"David Eisenbud & Joe Harris (1988). Vector spaces of matrices of low rank. Advances in Mathematics 70(2), 135 \u2013 155. ISSN 0001-8708. URL http:\/\/www.sciencedirect.com\/science\/article\/pii\/0001870888900540 .","DOI":"10.1016\/0001-8708(88)90054-0"},{"key":"143_CR31","doi-asserted-by":"publisher","unstructured":"Edward Formanek (1986). Generating the ring of matrix invariants. In Ring Theory, Freddy M. J. van Oystaeyen, editor, volume 1197 of Lecture Notes in Mathematics, 73\u201382. Springer Berlin Heidelberg. ISBN 978-3-540-16496-8. doi: 10.1007\/BFb0076314 .","DOI":"10.1007\/BFb0076314"},{"key":"143_CR32","unstructured":"M. Fortin & C. Reutenauer (2004). Commutative\/Noncommutative Rank of Linear Matrices and Subspaces of Matrices of Low Rank. S\u00e9minaire Lotharingien de Combinatoire 52, B52f."},{"key":"143_CR33","unstructured":"Ankit Garg, Leonid Gurvits, Rafael Oliveira & Avi Wigderson (2015). A deterministic polynomial time algorithm for non-commutative rational identity testing. Preprint arXiv:1511.03730 ."},{"issue":"2","key":"143_CR34","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s00493-005-0013-7","volume":"25","author":"James Geelen","year":"2005","unstructured":"Geelen James, Satoru Iwata (2005) Matroid matching via mixed skew-symmetric matrices. Combinatorica 25(2): 187\u2013215","journal-title":"Combinatorica"},{"key":"143_CR35","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0024-3795(98)10210-0","volume":"288","author":"James F. Geelen","year":"1999","unstructured":"Geelen James F. (1999) Maximum rank matrix completion. Linear Algebra and its Applications 288: 211\u2013217","journal-title":"Linear Algebra and its Applications"},{"key":"143_CR36","doi-asserted-by":"crossref","unstructured":"James F Geelen (2000). An algebraic matching algorithm. Combinatorica 20(1), 61\u201370","DOI":"10.1007\/s004930070031"},{"issue":"2","key":"143_CR37","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S0095-8956(03)00039-X","volume":"88","author":"F. Geelen James","year":"2003","unstructured":"Geelen James F., Iwata Satoru, Murota Kazuo (2003) The linear delta-matroid parity problem. Journal of Combinatorial Theory, Series B 88(2): 377\u2013398","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"5","key":"143_CR38","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01293593","volume":"7","author":"Willem A. Graaf de","year":"1996","unstructured":"de Graaf Willem A., Ivanyos G\u00e1bor, R\u00f3nyai Lajos (1996) Computing Cartan subalgebras of Lie algebras. Applicable Algebra in Engineering, Communication and Computing 7(5): 339\u2013349","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"3","key":"143_CR39","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.jcss.2004.06.003","volume":"69","author":"Leonid Gurvits","year":"2004","unstructured":"Gurvits Leonid (2004) Classical complexity and quantum entanglement. J. Comput. Syst. Sci. 69(3): 448\u2013484","journal-title":"J. Comput. Syst. Sci."},{"key":"143_CR40","unstructured":"Leonid Gurvits & Peter N. Yianilos (1998). The Deflation-Inflation Method for Certain Semidefinite Programming and Maximum Determinant Completion Problems (Extended Abstract). Technical report, NECI."},{"key":"143_CR41","unstructured":"Nicholas J. A. Harvey, David R. Karger & Kazuo Murota (2005). Deterministic network coding by matrix completion. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23\u201325, 2005, 489\u2013498. URL http:\/\/dl.acm.org\/citation.cfm?id=1070432.1070499 ."},{"key":"143_CR42","unstructured":"D. Hilbert (1893). Uber die vollen Invariantensysteme. Math. Ann. (42), 313\u2013370"},{"key":"143_CR43","doi-asserted-by":"publisher","unstructured":"Pavel Hrube\u0161 & Avi Wigderson (2015). Non-Commutative Arithmetic Circuits with Division. Theory of Computing 11, 357\u2013393. doi: 10.4086\/toc.2015.v011a014 .","DOI":"10.4086\/toc.2015.v011a014"},{"key":"143_CR44","doi-asserted-by":"publisher","unstructured":"G\u00e1bor Ivanyos, Marek Karpinski, Youming Qiao & Miklos Santha (2015a). Generalized Wong sequences and their applications to Edmonds\u2019 problems. J. Comput. Syst. Sci. 81(7), 1373\u20131386. doi: 10.1016\/j.jcss.2015.04.006 .","DOI":"10.1016\/j.jcss.2015.04.006"},{"issue":"8","key":"143_CR45","doi-asserted-by":"crossref","first-page":"3736","DOI":"10.1137\/090781231","volume":"39","author":"G\u00e1bor Ivanyos","year":"2010","unstructured":"Ivanyos G\u00e1bor, Karpinski Marek, Saxena Nitin (2010) Deterministic Polynomial Time Algorithms for Matrix Completion Problems. SIAM J. Comput. 39(8): 3736\u20133751","journal-title":"SIAM J. Comput."},{"key":"143_CR46","unstructured":"G\u00e1bor Ivanyos, Youming Qiao & K. V. Subrahmanyam (2015b). Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. CoRR abs\/1512.03531 ."},{"key":"143_CR47","unstructured":"G\u00e1bor Ivanyos, Youming Qiao & K. V. Subrahmanyam (2015c). On generating the ring of matrix semi-invariants. CoRR abs\/1508.01554 ."},{"issue":"1\u20132","key":"143_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00037-004-0182-6","volume":"13","author":"Valentine Kabanets","year":"2004","unstructured":"Kabanets Valentine, Impagliazzo Russell. (2004) Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Computational Complexity 13(1\u20132): 1\u201346","journal-title":"Computational Complexity"},{"key":"143_CR49","doi-asserted-by":"publisher","unstructured":"Erich Kaltofen (1992). On Computing Determinants of Matrices without Divisions. In Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, ISSAC \u201992, Berkeley, CA, USA, July 27\u201329, 1992, 342\u2013349. doi: 10.1145\/143242.143350 .","DOI":"10.1145\/143242.143350"},{"key":"143_CR50","doi-asserted-by":"crossref","unstructured":"T.Y. Lam (1991). A First Course in Noncommutative Rings. Graduate Texts in Mathematics. Springer.","DOI":"10.1007\/978-1-4684-0406-7"},{"key":"143_CR51","doi-asserted-by":"publisher","unstructured":"Nathan Linial, Alex Samorodnitsky & Avi Wigderson (2000). A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. Combinatorica 20(4), 545\u2013568. doi: 10.1007\/s004930070007 .","DOI":"10.1007\/s004930070007"},{"issue":"1","key":"143_CR52","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF02585470","volume":"20","author":"L\u00e1szl\u00f3 Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz L\u00e1szl\u00f3 (1989) Singular spaces of matrices and their application in combinatorics. Boletim da Sociedade Brasileira de Matem\u00e1tica-Bulletin\/Brazilian Mathematical Society 20(1): 87\u201399","journal-title":"Boletim da Sociedade Brasileira de Matem\u00e1tica-Bulletin\/Brazilian Mathematical Society"},{"key":"143_CR53","unstructured":"Meena Mahajan & V. Vinay (1997). Determinant: Combinatorics, Algorithms, and Complexity. Chicago Journal of Theoretical Computer Science 1997(5)."},{"key":"143_CR54","doi-asserted-by":"crossref","unstructured":"Peter Malcolmson (1978). A Prime Matrix Ideal Yields a Skew Field. Journal of the London Mathematical Society s2-18(2), 221\u2013233. URL http:\/\/jlms.oxfordjournals.org\/content\/s2-18\/2\/221.short .","DOI":"10.1112\/jlms\/s2-18.2.221"},{"key":"143_CR55","doi-asserted-by":"crossref","unstructured":"Laurent Manivel (2010). A note on certain Kronecker coefficients. Proceedings of the American Mathematical Society 138(1), 1\u20137","DOI":"10.1090\/S0002-9939-09-10086-2"},{"key":"143_CR56","doi-asserted-by":"publisher","unstructured":"Ketan Mulmuley (1987). A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatorica 7(1), 101\u2013104. doi: 10.1007\/BF02579205 .","DOI":"10.1007\/BF02579205"},{"key":"143_CR57","doi-asserted-by":"publisher","unstructured":"Ketan Mulmuley (2011). On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna. J. ACM 58(2), 5. doi: 10.1145\/1944345.1944346 .","DOI":"10.1145\/1944345.1944346"},{"key":"143_CR58","doi-asserted-by":"publisher","unstructured":"Ketan Mulmuley (2012). Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether\u2019s Normalization Lemma. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20\u201323, 2012, 629\u2013638. 10.1109\/FOCS.2012.15 .","DOI":"10.1109\/FOCS.2012.15"},{"key":"143_CR59","doi-asserted-by":"publisher","unstructured":"Ketan Mulmuley & Milind A. Sohoni (2001). Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems. SIAM J. Comput.31(2), 496\u2013526. doi: 10.1137\/S009753970038715X .","DOI":"10.1137\/S009753970038715X"},{"key":"143_CR60","doi-asserted-by":"publisher","unstructured":"Ketan Mulmuley & Milind A. Sohoni (2008). Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties. SIAM J. Comput. 38(3), 1175\u20131206. 10.1137\/080718115 .","DOI":"10.1137\/080718115"},{"key":"143_CR61","unstructured":"Kazuo Murota (2000). Matrices and matroids for systems analysis. Springer."},{"key":"143_CR62","doi-asserted-by":"crossref","unstructured":"Vladimir L Popov (1982). The constructive theory of invariants. Izvestiya: Mathematics 19(2), 359\u2013376","DOI":"10.1070\/IM1982v019n02ABEH001422"},{"issue":"3","key":"143_CR63","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/0001-8708(76)90027-X","volume":"19","author":"C. Procesi","year":"1976","unstructured":"Procesi C. (1976) The invariant theory of n\u00a0\u00d7 n matrices. Advances in Mathematics 19(3): 306\u2013381","journal-title":"Advances in Mathematics"},{"key":"143_CR64","doi-asserted-by":"crossref","unstructured":"Ju. P. Razmyslov (1974). Trace identities of full matrix algebras over a field of characteristic zero. Mathematics of the USSR-Izvestiya 8(4), 727. English translation available at http:\/\/iopscience.iop.org\/0025-5726\/8\/4\/A01 .","DOI":"10.1070\/IM1974v008n04ABEH002126"},{"key":"143_CR65","unstructured":"T. G. Room (1938). The Geometry of Determinantal Loci. The Cambridge University Press. URL http:\/\/books.google.com.au\/books?id=-kZtAAAAMAAJ ."},{"key":"143_CR66","doi-asserted-by":"crossref","unstructured":"Aidan Schofield & Michel Van den Bergh (2001). Semi-invariants of quivers for arbitrary dimension vectors. Indagationes Mathematicae 12(1), 125\u2013138.","DOI":"10.1016\/S0019-3577(01)80010-0"},{"issue":"2","key":"143_CR67","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"1","author":"W.T. Tutte","year":"1947","unstructured":"Tutte W.T. (1947) The factorization of linear graphs. Journal of the London Mathematical Society 1(2): 107\u2013111","journal-title":"Journal of the London Mathematical Society"},{"key":"143_CR68","unstructured":"E. Witt (1937). Zyklische K\u00f6rper und Algebren der Charakteristik p vom Grad pn. Struktur diskret bewerteter perfekter K\u00f6rper mit vollkommenem Restklassenk\u00f6rper der Charakteristik p. J. Reine Angew. Math 176(01), 126\u2013140."},{"key":"143_CR69","doi-asserted-by":"crossref","unstructured":"Kai-Tak Wong (1974). The eigenvalue problem \u03bb Tx\u00a0+\u00a0Sx. Journal of Differential Equations 16(2), 270 \u2013 280. ISSN 0022-0396. URL http:\/\/www.sciencedirect.com\/science\/article\/pii\/002203967490014X .","DOI":"10.1016\/0022-0396(74)90014-X"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-016-0143-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-016-0143-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-016-0143-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-016-0143-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T18:10:10Z","timestamp":1568311810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-016-0143-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,19]]},"references-count":69,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["143"],"URL":"https:\/\/doi.org\/10.1007\/s00037-016-0143-x","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,19]]}}}