We provide polynomial time algorithms for deciding equationsolvability and identity checking over groups that are semidirect products of two finite Abelian groups. Our main method is to reduce these problems to the s...
详细信息
We provide polynomial time algorithms for deciding equationsolvability and identity checking over groups that are semidirect products of two finite Abelian groups. Our main method is to reduce these problems to the sigma equationsolvability and sigma equivalence problems over modules for commutative unital rings. (C) 2015 Elsevier Inc. All rights reserved.
暂无评论