Article contents
ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPS
Published online by Cambridge University Press: 20 June 2018
Abstract
We analyze the computational complexity of an algorithm to solve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most exponential. For a subfamily of groups, we prove that the conjugacy search problem is polynomial. We also show that for a different subfamily the conjugacy search problem reduces to the discrete logarithm problem.
- Type
- Research Article
- Information
- Copyright
- Copyright © Glasgow Mathematical Journal Trust 2018
References
REFERENCES
- 2
- Cited by