{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T18:51:14Z","timestamp":1771872674957,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3796,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0747-7171(02)00139-6","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T02:09:52Z","timestamp":1049508592000},"page":"377-401","source":"Crossref","is-referenced-by-count":79,"title":["On lattice reduction for polynomial matrices"],"prefix":"10.1016","volume":"35","author":[{"given":"T.","family":"Mulders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Storjohann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(02)00139-6_B1","series-title":"Introduction to Commutative Algebra","author":"Atiyah","year":"1969"},{"key":"10.1016\/S0747-7171(02)00139-6_B2","series-title":"Proceedings of the Int\u2019l. Symp. on Symbolic and Algebraic Computation: ISSAC \u201999","first-page":"189","article-title":"Shifted normal forms of polynomial matrices","author":"Beckermann","year":"1999"},{"key":"10.1016\/S0747-7171(02)00139-6_B3","series-title":"Normal forms for general polynomial matrices, Research Report 2002\u20131","author":"Beckermann","year":"2002"},{"issue":"1","key":"10.1016\/S0747-7171(02)00139-6_B4","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/moor.12.1.50","article-title":"Hermite normal form computation using modulo determinant arithmetic","volume":"12","author":"Domich","year":"1987","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0747-7171(02)00139-6_B5","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1090\/S0025-5718-1984-0736459-9","article-title":"Hensel and Newton methods in valuation rings","volume":"42","author":"von zur Gathen","year":"1984","journal-title":"Mathematics of Computation"},{"key":"10.1016\/S0747-7171(02)00139-6_B6","series-title":"Modern Computer Algebra","author":"von zur Gathen","year":"1999"},{"key":"10.1016\/S0747-7171(02)00139-6_B7","series-title":"Linear Systems","author":"Kailath","year":"1980"},{"key":"10.1016\/S0747-7171(02)00139-6_B8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(95)00090-9","article-title":"Algorithmes de calcul de la r\u00e9duction de Hermite d\u2019une matrice \u00e0coefficients polynomiaux","volume":"161","author":"Labhalla","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0747-7171(02)00139-6_B9","series-title":"The Theory of Matrices","author":"MacDuffee","year":"1956"},{"key":"10.1016\/S0747-7171(02)00139-6_B10","unstructured":"Mulders, T., Storjohann, A., 2000a. Certified dense linear system solving. Techreport 355, ETH Zurich, Department of Computer Science. Journal of Symbolic Computation (to appear)"},{"key":"10.1016\/S0747-7171(02)00139-6_B11","doi-asserted-by":"crossref","unstructured":"Mulders, T., Storjohann, A., 2000b. Rational solutions of singular linear systems. In: Traverso, C. (Ed.), Proceedings of the Int\u2019l. Symp. on Symbolic and Algebraic Computation: ISSAC \u201900, ACM Press, New York, pp. 242\u2013249","DOI":"10.1145\/345542.345644"},{"key":"10.1016\/S0747-7171(02)00139-6_B12","series-title":"Integral Matrices","author":"Newman","year":"1972"},{"key":"10.1016\/S0747-7171(02)00139-6_B13","article-title":"Some properties of control systems with irreducible matrix transfer functions","volume":"vol. 144","author":"Popov","year":"1969"},{"key":"10.1016\/S0747-7171(02)00139-6_B14","series-title":"Proceedings of the Int\u2019l. Symp. on Symbolic and Algebraic Computation: ISSAC \u201902","first-page":"246","article-title":"High-order lifting","author":"Storjohann","year":"2002"},{"key":"10.1016\/S0747-7171(02)00139-6_B15","series-title":"Proceedings of the Int\u2019l. Symp. on Symbolic and Algebraic Computation: ISSAC \u201996","first-page":"250","article-title":"Computing Popov and Hermite forms of polynomial matrices","author":"Villard","year":"1996"},{"key":"10.1016\/S0747-7171(02)00139-6_B16","series-title":"Proceedings of the Int\u2019l. Symp. on Symbolic and Algebraic Computation: ISSAC \u201994","first-page":"25","article-title":"A first report on the A\u266f Compiler","author":"Watt","year":"1994"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717102001396?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717102001396?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T05:51:11Z","timestamp":1553665871000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717102001396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0747717102001396"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(02)00139-6","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}