Polynomial time algorithms for modules over finite dimensional algebras

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Polynomial time algorithms for modules over finite dimensional algebras

Full text

Pdf (904 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1997 international symposium on Symbolic and algebraic computation table of contents

Kihei, Maui, Hawaii, United States

Pages: 68 - 74

Year of Publication: 1997

ISBN:0-89791-875-4

Authors

Alexander Chistov	St. Petersburg Institute for Informatics and Automation of the Academy of Sciences of Russia, 14th line 39, St. Petersburg 199178, Russia
Gábor Ivanyos	Computer and Automation Institute, Hungarian Academy of Sciences, Lágymányosi u. 11, H-1111 Budapest, Hungary
Marek Karpinski	Department of Computer Science, University of Bonn, 53117 Bonn and International Computer Science Institute, Berkeley, California

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 28, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/258726.258751 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BaBAt, L., ANt) R6NYat, L. Computing irreducible representations of finite groups. Mathematics of Com. putation 55, 192 (1990), 705-722.
	2	Alexander Chistov , Marek Karpinski, Polynomial Time Decomposition of Modules over Algebras and its Application, University of Bonn, 1996
	3	COHEN, A. M., IVANYOS, G., AND WALES, D. B. Finding the radical of an algebra of linear transformations. J. Pure and Applied Algebra (1997), to appear. (Spec. issue: Proc. 4th Int. Symp. on Effective Methods in Algebraic Geometry).
	4	DE GRAAF, W. A., IVANYOS, G., K ORONYA, A., AND R6NYAI, L. Computing Levi decompositions. Applicable Al9ebra in Engineering, Communication and Computing (to appear).
	5	EBEaLY, W. M. Decompositions of algebras over R and C. Computational Complexity I (1991), 179-206.
	6	EDMONDS, J. System of distinct representatives and linear algebra. Journal of Research of the National Bureau of Standards 718, 4 (1967), 241-245.
	7	K Friedl , L Rónyai, Polynomial time solutions of some problems of computational algebra, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.153-162, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22162]
	8	HOLT, D. F., AND REES, S. Testing modules for irreducibility. J. Austral. Math. Soc. Set. A 57 (1994), 1-16.
	9	LANDAU, S. Factoring polynomials over algebraic number fields. SIAM J. on Computing 14 (1985), 184-195.
	10	PArtKEa, R. A. The computer calculation of modular characters (the Meat-Axe). In Computational Group Theory (1984), Academic Press, pp. 267-274.
	11	PXERCE, R. S. Associative Algebras. Springer-Verlag, 1982.
	12	Lajos Rónyai, Zero divisers in quaternion algebras, Journal of Algorithms, v.9 n.4, p.494-506, Dec. 1988 [doi>10.1016/0196-6774(88)90014-4]
	13	Lajos Rónyai, Computing the structure of finite algebras, Journal of Symbolic Computation, v.9 n.3, p.355-373, March 1990 [doi>10.1016/S0747-7171(08)80017-X]
	14	Lajos Rónyai, A deterministic method for computing splitting elements in simple algebras over Q, Journal of Algorithms, v.16 n.1, p.24-32, Jan. 1994 [doi>10.1006/jagm.1994.1002]
	15	J. T. Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities, Journal of the ACM (JACM), v.27 n.4, p.701-717, Oct. 1980 [doi>10.1145/322217.322225]
	16	Richard Zippel, Probabilistic algorithms for sparse polynomials, Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, p.216-226, June 01, 1979

CITED BY 3

	Edward L. Green , Lenwood S. Heath , Craig A. Struble, Constructing endomorphism rings via duals, Proceedings of the 2000 international symposium on Symbolic and algebraic computation, p.129-136, July 2000, St. Andrews, Scotland
	Leonid Gurvits, Classical deterministic complexity of Edmonds' Problem and quantum entanglement, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
	Leonid Gurvits, Classical complexity and quantum entanglement, Journal of Computer and System Sciences, v.69 n.3, p.448-484, November 2004