On the Conjugacy Problem in Certain Metabelian Groups
Group Theory
2019-03-27 v2 Computational Complexity
Abstract
Weanalyzethecomputationalcomplexityofanalgorithmtosolve 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.
Cite
@article{arxiv.1610.06503,
title = {On the Conjugacy Problem in Certain Metabelian Groups},
author = {Jonathan Gryak and Delaram Kahrobaei and Conchita Martinez-Perez},
journal= {arXiv preprint arXiv:1610.06503},
year = {2019}
}