{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:37:41Z","timestamp":1776843461480,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540429111","type":"print"},{"value":"9783540456247","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45624-4_31","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T23:23:35Z","timestamp":1180826615000},"page":"297-307","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms for Large Integer Matrix Problems"],"prefix":"10.1007","author":[{"given":"Mark","family":"Giesbrecht","sequence":"first","affiliation":[]},{"given":"Michael","family":"Jr. Jacobson","sequence":"additional","affiliation":[]},{"given":"Arne","family":"Storjohann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"31_CR1","series-title":"Lecture notes in Math.","first-page":"33","volume-title":"Number Theory","author":"H. Cohen","year":"1983","unstructured":"H. Cohen and H. Lenstra, Jr. Heuristics on class groups of number fields. In Number Theory, Lecture notes in Math., volume 1068, pages 33\u201362. Springer-Verlag, New York, 1983."},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF01459082","volume":"40","author":"J. D. Dixon","year":"1982","unstructured":"J. D. Dixon. Exact solution of linear equations using p-adic expansions. Numer. Math., 40:137\u2013141, 1982.","journal-title":"Numer. Math."},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1287\/moor.12.1.50","volume":"12","author":"P. D. Domich","year":"1987","unstructured":"P. D. Domich, R. Kannan, and L. E. Trotter, Jr. Hermite normal form computation using modulo determinant arithmetic. Mathematics of Operations Research, 12(1):50\u201359, 1987.","journal-title":"Mathematics of Operations Research"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"837","DOI":"10.2307\/1990896","volume":"2","author":"J. L. Hafner","year":"1989","unstructured":"J. L. Hafner and K. S. McCurley. A rigorous subexponential algorithm for computation of class groups. J. Amer. Math. Soc., 2:837\u2013850, 1989.","journal-title":"J. Amer. Math. Soc."},{"issue":"4","key":"31_CR5","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/0218045","volume":"18","author":"C. S. Iliopoulos","year":"1989","unstructured":"C. S. Iliopoulos. Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrix. SIAM Journal of Computing, 18(4):658\u2013669, 1989.","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"31_CR6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1515\/dema-1978-0121","volume":"11","author":"H. Iwaniec","year":"1978","unstructured":"H. Iwaniec. On the problem of Jacobsthal. Demonstratio Mathematica, 11(1):225\u2013231, 1978.","journal-title":"Demonstratio Mathematica"},{"key":"31_CR7","unstructured":"M. J. Jacobson, Jr. Subexponential Class Group Computation in Quadratic Orders. PhD thesis, Technischen Universit\u00e4t Darmstadt, 1999."},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"F. L\u00fcbeck. On the computation of elementary divisors of integer matrices. Journal of Symbolic Computation, 2001. To appear.","DOI":"10.1006\/jsco.2000.0430"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"T. Mulders and A. Storjohann. Diophantine linear system solving. In S. Dooley, editor, Proc. Int\u2019l. Symp. on Symbolic and Algebraic Computation: ISSAC\u2019 99, pages 281\u2013288. ACM Press, 1999.","DOI":"10.1145\/309831.309905"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"T. Mulders and A. Storjohann. Rational solutions of singular linear systems. In C. Traverso, editor, Proc. Int\u2019l. Symp. on Symbolic and Algebraic Computation: ISSAC\u2019 00, pages 242\u2013249. ACM Press, 2000.","DOI":"10.1145\/345542.345644"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"A. Storjohann. A solution to the extended gcd problem with applications. In W. W. K\u00fcchlin, editor, Proc. Int\u2019l. Symp. on Symbolic and Algebraic Computation: ISSAC\u2019 97, pages 109\u2013116. ACM Press, 1997.","DOI":"10.1145\/258726.258762"},{"key":"31_CR12","unstructured":"A. Storjohann. Algorithms for Matrix Canonical Forms. PhD thesis, ETH-Swiss Federal Institute of Technology, 2000."},{"key":"31_CR13","unstructured":"J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999."},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D. Wiedemann","year":"1986","unstructured":"D. Wiedemann. Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory, IT-32:54\u201362, 1986.","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45624-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:30:46Z","timestamp":1556469046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45624-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429111","9783540456247"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45624-4_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}