Computing the structure of finite algebras
- 31 March 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 9 (3) , 355-373
- https://doi.org/10.1016/s0747-7171(08)80017-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982
- A new algorithm for factoring polynomials over finite fieldsMathematics of Computation, 1981
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Algebras and their arithmeticsBulletin of the American Mathematical Society, 1924