doi:10.1017/S0017089518000198engGryak, J.Kahrobaei, D.Martinez-Perez, C.On the conjugacy problem in certain metabelian groupsART-2019-109599We 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.2019http://zaguan.unizar.es/record/9543810.1017/S0017089518000198http://zaguan.unizar.es/record/95438oai:zaguan.unizar.es:95438info:eu-repo/grantAgreement/ES/MINECO-FEDER/MTM2015-67781GLASGOW MATHEMATICAL JOURNAL 61, 2 (2019), 251-269All rights reservedhttp://www.europeana.eu/rights/rr-f/info:eu-repo/semantics/openAccess