{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T18:32:39Z","timestamp":1757701959710},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"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,9]]},"DOI":"10.1007\/bf01200061","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:07:51Z","timestamp":1108728471000},"page":"211-234","source":"Crossref","is-referenced-by-count":16,"title":["Decompositions of algebras over ? and ?"],"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","first-page":"83","volume-title":"Computer Algebra, Symbolic and Algebraic Computation","author":"G. E. Collins","year":"1983","unstructured":"G. E. Collins andR. Loos, Real zeroes of polynomials, inComputer Algebra, Symbolic and Algebraic Computation, Second Edition, Springer-Verlag, New York, 1983, 83?94.","edition":"Second Edition"},{"key":"CR3","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":"CR4","unstructured":"W. Eberly,Computations for algebras and group representations, Department of Computer Science Technical Report 225\/89, University of Toronto, 1989."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01272520","volume":"1","author":"W. Eberly","year":"1991","unstructured":"W. Eberly Decompositions of algebras over finite fields and number fields,Computational Complexity 1 (1991), 183?210.","journal-title":"Computational Complexity"},{"key":"CR6","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":"CR7","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":"CR8","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":"CR9","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":"CR10","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":"CR11","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":"CR12","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":"CR13","first-page":"173","volume-title":"Computer Algebra, Symbolic and Algebraic Computation","author":"R. Loos","year":"1983","unstructured":"R. Loos, Computing in algebraic extensions, inComputer Algebra, Symbolic and Algebraic Computation, Second Edition, Springer-Verlag, New York, 1983, 173?187.","edition":"Second Edition"},{"key":"CR14","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":"CR15","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/355705.355710","volume":"2","author":"J. R. Pinkert","year":"1976","unstructured":"J. R. Pinkert, An exact method for finding the roots of a complex polynomial,ACM Transactions on Mathematical Software 2 (1976), 351?363.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR16","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":"CR17","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":"CR18","unstructured":"L. R\u00f3nyai, Algorithmic properties of maximal orders in simple algebras over?,Computational Complexity, to appear."},{"key":"CR19","unstructured":"A. Sch\u00f6nhage, The fundamental theorem of algebra in terms of computational complexity, Technical Report, Universit\u00e4t T\u00fcbingen, 1982."},{"key":"CR20","volume-title":"Algebra, Volume 1","author":"B. L. Waerden van der","year":"1970","unstructured":"B. L. van der Waerden,Algebra, Volume 1, Frederick Ungar, New York, 1970."}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200061.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200061\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:57:03Z","timestamp":1586120223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["BF01200061"],"URL":"https:\/\/doi.org\/10.1007\/bf01200061","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}