95438 20200922142031.0 doi 10.1017/S0017089518000198 sideral 109599 ART-2019-109599 eng Gryak, J. On the conjugacy problem in certain metabelian groups 2019 Access copy available to the general public Unrestricted 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. info:eu-repo/grantAgreement/ES/MINECO-FEDER/MTM2015-67781 info:eu-repo/semantics/openAccess All rights reserved http://www.europeana.eu/rights/rr-f/ 0.548 2019 MATHEMATICS 245 / 324 = 0.756 2019 Q4 T3 0.427 2019 Mathematics (miscellaneous) 2019 Q2 info:eu-repo/semantics/article info:eu-repo/semantics/submittedVersion Kahrobaei, D. (orcid)0000-0001-9147-1745 Martinez-Perez, C. Universidad de Zaragoza 2006 005 Universidad de Zaragoza Dpto. Matemáticas Área Algebra 61, 2 (2019), 251-269 Glasg. mat. j. GLASGOW MATHEMATICAL JOURNAL 0017-0895 262675 http://zaguan.unizar.es/record/95438/files/texto_completo.pdf Preprint 25928 http://zaguan.unizar.es/record/95438/files/texto_completo.jpg?subformat=icon icon Preprint oai:zaguan.unizar.es:95438 articulos driver 2020-09-22-12:17:32 ARTICLE