Efficient decomposition of associative algebras

Authors:
W. Eberly;M. Giesbrecht
Affiliations:
Department of Computer Science, University of Calgary, Calgary, Alberta, Canada, T2N 1N4;Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada, R3T 2N2
Venue:
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Year:
1996

Polynomial time solutions of some problems of computational algebra

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Simple algebras are difficult

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Computing the structure of finite algebras

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Some problems in computational representation theory

Journal of Symbolic Computation
Computing with endomorphism ringsof modular representations

Journal of Symbolic Computation
Nearly Optimal Algorithms For Canonical Matrix Forms

SIAM Journal on Computing
Decomposition of Algebras

ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation

Hi-index	0.00