Publisher
Springer Science and Business Media LLC
Subject
Algebra and Number Theory
Reference19 articles.
1. Almeida, J., Volkov, M.V., Goldberg, S.V.: Complexity of the identity checking problem for finite semigroups. J. Math. Sci. 158(5), 605–614 (2009)
2. Burris, S., Lawrence, J.: The equivalence problem for finite rings. J. Symb. Comput. 15, 67–71 (1993)
3. Burris, S., Lawrence, J.: Results on the equivalence problem for finite groups. Algebra Univers. 52(4), 495–500 (2005)
4. Goldmann, M., Russell, A.: The complexity of solving equations over finite groups. In: Proc. IEEE Conf. on Computational Complexity, pp. 80–86 (1999)
5. Horváth, G., Lawrence, J., Mérai, L., Szabó, Cs.: The complexity of the equivalence problem for nonsolvable groups. Bull. Lond. Math. Soc. 39, 433–438 (2007)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献