{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T04:47:17Z","timestamp":1775537237283,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540249986","type":"print"},{"value":"9783540318569","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_39","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"472-484","source":"Crossref","is-referenced-by-count":4,"title":["The Complexity of Solving Linear Equations over a Finite Ring"],"prefix":"10.1007","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. C.","family":"Vijayaraghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Arvind, V., Vijayaraghavan, T.C.: Abelian Permutation Group Problems and Logspace Counting Classes. In: IEEE Annual Conference on Computational Complexity (CCC 2004), pp. 204\u2013214 (2004)","DOI":"10.1109\/CCC.2004.1313844"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s000370050023","volume":"8","author":"E. Allender","year":"1999","unstructured":"Allender, E., Beals, R., Ogihara, M.: The complexity of matrix rank and feasible systems of linear equations. Computational Complexity\u00a08, 99\u2013126 (1999)","journal-title":"Computational Complexity"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/jcss.1999.1646","volume":"59","author":"E. Allender","year":"1999","unstructured":"Allender, E., Reinhardt, K., Zhou, S.: Isolation, matching, and counting: Uniform and nonuniform upper bounds. Journal of Computer and System Sciences\u00a059, 164\u2013181 (1999)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"39_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01374526","volume":"25","author":"G. Buntrock","year":"1992","unstructured":"Buntrock, G., Damm, C., Hertrampf, U., Meinel, C.: Structure and Importance of Logspace-MOD Classes. Mathematical Systems Theory\u00a025(3), 223\u2013237 (1992)","journal-title":"Mathematical Systems Theory"},{"key":"39_CR5","series-title":"Diophantine analysis","volume-title":"History of the theory of numbers","author":"L.E. Dickson","year":"1992","unstructured":"Dickson, L.E.: History of the theory of numbers. Diophantine analysis, vol.\u00a0II. Chelsea Publishing Company, New York (1992)"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Giesbrecht, M.: Fast computations of the Smith Normal Form of an integer matrix. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, pp. 110\u2013118 (1995)","DOI":"10.1145\/220346.220361"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Giesbrecht, M.: Efficient parallel solution of sparse systems of linear diophantine equations. In: Proceedings of the second international symposium on Parallel Symbolic Computation, pp. 1\u201310 (1997)","DOI":"10.1145\/266670.266678"},{"issue":"5","key":"39_CR8","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/S0097539700389652","volume":"31","author":"A. Klivans","year":"2002","unstructured":"Klivans, A., van Melkebeek, D.: Graph Isomorphism has subexponential size provers unless the polynomial time hierarchy collapses. SIAM Journal of Computing\u00a031(5), 1501\u20131526 (2002)","journal-title":"SIAM Journal of Computing"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1137\/0216058","volume":"16","author":"P. McKenzie","year":"1987","unstructured":"McKenzie, P., Cook, S.: The parallel complexity of abelian permutation group problems. Siam Journal on Computing\u00a016, 880\u2013909 (1987)","journal-title":"Siam Journal on Computing"},{"key":"39_CR10","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, Chichester (1998)"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/BF01448871","volume":"100","author":"K. Shoda","year":"1928","unstructured":"Shoda, K.: \u00dcber die Automorphismen einer endlichen Abelschen Gruppe. Mathematische Annalen\u00a0100, 674\u2013686 (1928); Source: The G\u00f6ttingen State and University Library, http:\/\/www.sub.uni-goettingen.de","journal-title":"Mathematische Annalen"},{"key":"39_CR12","unstructured":"Toda, S.: Counting problems computationally equivalent to computing the determinant. Technical Report CSIM 91-07, Department of Computer Science, University of Electro-Communications, Tokyo, Japan (May 1991)"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Vinay, V.: Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In: Structure in Complexity Theory Conference, pp. 270\u2013284 (1991)","DOI":"10.1109\/SCT.1991.160269"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:09:58Z","timestamp":1739920198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}