{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T05:03:35Z","timestamp":1766466215902},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,18]],"date-time":"2017-01-18T00:00:00Z","timestamp":1484697600000},"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":["Found Comput Math"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10208-017-9343-2","type":"journal-article","created":{"date-parts":[[2017,1,18]],"date-time":"2017-01-18T19:55:35Z","timestamp":1484769335000},"page":"381-397","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Computing Explicit Isomorphisms with Full Matrix Algebras over $$\\mathbb {F}_q(x)$$ F q ( x )"],"prefix":"10.1007","volume":"18","author":[{"given":"G\u00e1bor","family":"Ivanyos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u00e9ter","family":"Kutas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lajos","family":"R\u00f3nyai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,18]]},"reference":[{"key":"9343_CR1","unstructured":"M. Ajtai: The shortest vector problem in $$L_2$$ L 2 is NP-hard for randomized reductions, Proceedings of the 30th annual ACM symposium on Theory of computing (1998), Dallas, Texas, United States, ACM. pp. 10-19."},{"key":"9343_CR2","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1002\/j.1538-7305.1967.tb03174.x","volume":"46","author":"ER Berlekamp","year":"1967","unstructured":"E.R. Berlekamp: Factoring polynomials over finite fields, Bell System Technical Journal 46 (1967), pp. 1853-1859.","journal-title":"Bell System Technical Journal"},{"key":"9343_CR3","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"DG Cantor","year":"1981","unstructured":"D.G. Cantor, H. Zassenhaus: A new algorithm for factoring polynomials over finite fields, Mathematics of Computation 36 (1981), pp. 587-592.","journal-title":"Mathematics of Computation"},{"key":"9343_CR4","unstructured":"J.E. Cremona, T.A. Fisher, C. O\u2019neil, D. Simon, M. Stoll: Explicit $$n$$ n -descent on elliptic curves I. Algebra, Journal f\u00fcr die reine und angewandte Mathematik, Vol. 615 (2008), pp. 121-155."},{"key":"9343_CR5","unstructured":"J.E. Cremona, T.A. Fisher, C. O\u2019neil, D. Simon, M. Stoll: Explicit $$n$$ n -descent on elliptic curves II. Geometry, Journal f\u00fcr die reine und angewandte Mathematik 632 (2009), pp. 63\u201384."},{"key":"9343_CR6","doi-asserted-by":"crossref","unstructured":"J.E. Cremona, T.A. Fisher, C. O\u2019neil, D. Simon, M. Stoll: Explicit $$n$$ n -descent on elliptic curves III. Algorithms, Mathematics of Computation 84 No.292 (2015), 895-922.","DOI":"10.1090\/S0025-5718-2014-02858-5"},{"key":"9343_CR7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s002000050066","volume":"8","author":"WA Graaf de","year":"1997","unstructured":"W.A. de Graaf, G. Ivanyos, A. K\u00fcronya, L. R\u00f3nyai: Computing Levi decompositions, Applicable Algebra in Engineering, Communication and Computing 8 (1997), pp. 291-304.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"9343_CR8","volume-title":"Finite dimensional algebras","author":"Y Drozd","year":"1980","unstructured":"Y. Drozd, V.V. Kirichenko: Finite dimensional algebras, Vyshcha Shkola, Kiev, 1980."},{"key":"9343_CR9","unstructured":"K. Friedl, L. R\u00f3nyai: Polynomial time solutions of some problems in computational algebra, Proceedings of the 17th annual ACM symposium on Theory of computing (1985), Providence, Rhode Island, United States, ACM. pp. 153-162."},{"key":"9343_CR10","doi-asserted-by":"crossref","unstructured":"M. Giesbrecht, Y. Zhang: Factoring and decomposing Ore polynomials over $$\\mathbb{F}_q(T)$$ F q ( T ) , Proceedingss of the 2003 International Symposium on Symbolic and Algebraic Computation (ISSAC2003), New York, NY, United States, ACM. pp. 127-134.","DOI":"10.1145\/860854.860888"},{"key":"9343_CR11","unstructured":"J. G\u00f3mez-Torrecillas, F. J. Lobillo, G. Navarro: Factoring Ore polynomials over $${\\mathbb{F}}_q(t)$$ F q ( t ) is difficult, (2015) Preprint arXiv:1505.07252 ."},{"key":"9343_CR12","unstructured":"G. Ivanyos: Algorithms for algebras over global field, Ph.D. thesis, Hungarian Academy of Sciences (1996), http:\/\/real-d.mtak.hu\/261\/1\/Ivanyos_Gabor ."},{"key":"9343_CR13","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1090\/S0025-5718-2011-02505-6","volume":"81","author":"G Ivanyos","year":"2012","unstructured":"G. Ivanyos, M. Karpinski, L. R\u00f3nyai, N. Saxena: Trading GRH for algebra: algorithms for factoring polynomials and related structures, Matematics of Computation 81 (2012), pp. 493-531.","journal-title":"Matematics of Computation"},{"key":"9343_CR14","first-page":"141","volume":"28","author":"G Ivanyos","year":"2013","unstructured":"G. Ivanyos, \u00c1. Lelkes, L. R\u00f3nyai: Improved algorithms for splitting full matrix algebras, JP Journal of Algebra, Number Theory and Applications 28 (2013), pp. 141-156.","journal-title":"JP Journal of Algebra, Number Theory and Applications"},{"key":"9343_CR15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01271370","volume":"3","author":"G Ivanyos","year":"1993","unstructured":"G. Ivanyos, L. R\u00f3nyai: On the complexity of finding maximal orders in semisimple algebras over $${\\mathbb{Q}}$$ Q , Comput. complexity 3 (1993), pp. 245-261.","journal-title":"Comput. complexity"},{"key":"9343_CR16","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.jalgebra.2012.01.008","volume":"354","author":"G Ivanyos","year":"2012","unstructured":"G. Ivanyos, L. R\u00f3nyai, J. Schicho: Splitting full matrix algebras over algebraic number fields, Journal of Algebra 354 (2012), pp. 211-223.","journal-title":"Journal of Algebra"},{"key":"9343_CR17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01438277","volume":"5","author":"G Ivanyos","year":"1994","unstructured":"G. Ivanyos, L. R\u00f3nyai, \u00c1. Sz\u00e1nt\u00f3: Decomposition of algebras over $${\\mathbb{F}}_q(x_1,... ,x_m)$$ F q ( x 1 , . . . , x m ) , Applicable Algebra in Engineering, Communication and Computing 5 (1994), pp. 71-90.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"2","key":"9343_CR18","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0022-0000(85)90016-9","volume":"30","author":"AK Lenstra","year":"1985","unstructured":"A.K. Lenstra: Factoring multivariate polynomials over finite fields, Journal of Computer and System Sciences 30 (2) (1985), pp. 235-248.","journal-title":"Journal of Computer and System Sciences"},{"key":"9343_CR19","doi-asserted-by":"crossref","unstructured":"S. Paulus: Lattice basis reduction in function fields, J. Buhler (Ed.), Proceedings of the Third Symposium on Algorithmic Number Theory, Portland, Oregon, United States: ANTS-III, Springer LNCS 1423 (1998), pp. 567-575.","DOI":"10.1007\/BFb0054893"},{"key":"9343_CR20","unstructured":"I. Reiner: Maximal orders, Academic Press, London, 1975."},{"key":"9343_CR21","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0747-7171(08)80017-X","volume":"9","author":"L R\u00f3nyai","year":"1990","unstructured":"L. R\u00f3nyai: Computing the structure of finite algebras, Journal of Symbolic Computation 9 (1990), pp. 355-373.","journal-title":"Journal of Symbolic Computation"},{"key":"9343_CR22","doi-asserted-by":"crossref","unstructured":"M-F. Vign\u00e9ras: Arithm\u00e9tique des Alg\u00e8bres de Quaternions, Springer, LNM 800, 1980.","DOI":"10.1007\/BFb0091027"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-017-9343-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-017-9343-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-017-9343-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T18:29:56Z","timestamp":1568744996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-017-9343-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,18]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9343"],"URL":"https:\/\/doi.org\/10.1007\/s10208-017-9343-2","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,18]]}}}