{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:03:02Z","timestamp":1758279782993},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01272520","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T07:41:27Z","timestamp":1111650087000},"page":"183-210","source":"Crossref","is-referenced-by-count":14,"title":["Decomposition of algebras over finite fields and number fields"],"prefix":"10.1007","volume":"1","author":[{"given":"Wayne","family":"Eberly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1090\/S0025-5718-1990-1035925-1","volume":"55","author":"L. Babai","year":"1990","unstructured":"L. Babai andL. R\u00f3nyai, Computing irreducible representations of finite groups,Math. Comp. 55 (1990), 705?722.","journal-title":"Math. Comp."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"S. J. Berkowitz","year":"1984","unstructured":"S. J. Berkowitz, On computing the determinant in small parallel time using a small number of processors,Information Processing Letters 18 (1984), 147?150.","journal-title":"Information Processing Letters"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1002\/j.1538-7305.1967.tb03174.x","volume":"46","author":"E. R. Berlekamp","year":"1967","unstructured":"E. R. Berlekamp, Factoring polynomials over finite fields,Bell System Tech. J. 46 (1967), 1853?1859.","journal-title":"Bell System Tech. J."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"E. R. Berlekamp","year":"1970","unstructured":"E. R. Berlekamp, Factoring polynomials over large finite fields,Math. Comp. 24 (1970), 713?735.","journal-title":"Math. Comp."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","volume":"52","author":"A. Borodin","year":"1982","unstructured":"A. Borodin, J. von zur Gathen, andJ. Hopcroft, Fast parallel matrix and GCD computations,Information and Control 52 (1982), 241?256.","journal-title":"Information and Control"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"D. G. Cantor","year":"1981","unstructured":"D. G. Cantor andH. Zassenhaus, A new algorithm for factoring polynomials over finite fields.Math. Comp. 36 (1981), 587?592.","journal-title":"Math. Comp."},{"key":"CR7","volume-title":"Representation Theory of Finite Groups and Associative Algebras","author":"C. W. Curtis","year":"1962","unstructured":"C. W. Curtis andI. Reiner,Representation Theory of Finite Groups and Associative Algebras, Wiley, New York, 1962."},{"key":"CR8","unstructured":"W. Eberly,Computations for algebras and group representations, Department of Computer Science Technical Report 225\/89, University of Toronto, 1989."},{"key":"CR9","first-page":"207","volume":"1","author":"W. Eberly","year":"1991","unstructured":"W. Eberly, Decomposition of algebras over ? and ?,Computational Complexity 1 (1991), 207?230.","journal-title":"Computational Complexity"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"K. Friedl and L. R\u00f3nyai, Polynomial time solutions for some problems in computational algebra, inProc. 17th Ann. Symp. Theory of Computing, 1985, 153?162.","DOI":"10.1145\/22145.22162"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1063\/1.1704141","volume":"5","author":"J. Gabriel","year":"1964","unstructured":"J. Gabriel, New methods for reduction of group representations using an extension of Schur's lemma,J. Math. Phys. 5 (1964), 494?504.","journal-title":"J. Math. Phys."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1063\/1.1664689","volume":"9","author":"J. Gabriel","year":"1968","unstructured":"J. Gabriel, New methods for reduction of group representations II,J. Math. Phys. 9 (1968), 973?976.","journal-title":"J. Math. Phys."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1789","DOI":"10.1063\/1.1665028","volume":"10","author":"J. Gabriel","year":"1969","unstructured":"J. Gabriel, New methods for reduction of group representations III,J. Math. Phys. 10 (1969), 1789?1795.","journal-title":"J. Math. Phys."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1932","DOI":"10.1063\/1.1664785","volume":"10","author":"J. Gabriel","year":"1969","unstructured":"J. Gabriel, new methods for reduction of group representations IV,J. Math. Phys. 10 (1969), 1932?1934.","journal-title":"J. Math. Phys."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"J. Gabriel, Numerical methods for reduction of group representations, inProc. 2nd ACM Symp. Symbolic and Algebraic Manipulation, 1971, 180?182.","DOI":"10.1145\/800204.806285"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1137\/0213050","volume":"13","author":"J. Gathen von zur","year":"1984","unstructured":"J. von zur Gathen, Parallel algorithms for algebraic problems,SIAM J. Comput. 13 (1984), 802?824.","journal-title":"SIAM J. Comput."},{"key":"CR17","first-page":"225","volume":"31","author":"J. Gathen von zur","year":"1985","unstructured":"J. von zur Gathen, Irreducibility of multivariate polynomials,JCSS 31 (1985), 225?264.","journal-title":"JCSS"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0214015","volume":"14","author":"S. Landau","year":"1985","unstructured":"S. Landau, Factoring polynomials over algebraic number fields,SIAM J. Comput. 14 (1985), 184?196.","journal-title":"SIAM J. Comput."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"A. K. Lenstra, H. W. Lenstra, andL. Lov\u00e1sz, Factoring polynomials with rational coefficients,Math. Ann. 261 (1982), 515?534.","journal-title":"Math. Ann."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02579205","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"K. Mulmuley, A fast parallel algorithm to compute the rank of a matrix over an arbitrary field,Combinatorica 7 (1987), 101?104.","journal-title":"Combinatorica"},{"key":"CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-0163-0","volume-title":"Associative Algebras","author":"R. S. Pierce","year":"1982","unstructured":"R. S. Pierce,Associative Algebras, Springer-Verlag, New York, 1982."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M. Rabin","year":"1980","unstructured":"M. Rabin, Probabilistic algorithms in finite fields,SIAM J. Comput. 9 (1980), 273?280.","journal-title":"SIAM J. Comput."},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"L. R\u00f3nyai, Simple algebras are difficult, inProc. 19th Ann. Symp. Theory of Computing, 1987, 398?408.","DOI":"10.1145\/28395.28438"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/0196-6774(88)90014-4","volume":"9","author":"L. R\u00f3nyai","year":"1988","unstructured":"L. R\u00f3nyai, Zero divisors in quaternion algebras,Journal of Algorithms 9 (1988), 494?506.","journal-title":"Journal of Algorithms"},{"key":"CR25","unstructured":"L. R\u00f3nyai, Algorithmic properties of maximal orders in simple algebras over ?, manuscript, 1991."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. T. Schwartz","year":"1980","unstructured":"J. T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities,JACM 27 (1980), 701?717.","journal-title":"JACM"}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01272520.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01272520\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01272520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:01:33Z","timestamp":1586178093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01272520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01272520"],"URL":"https:\/\/doi.org\/10.1007\/bf01272520","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}