000095438 001__ 95438 000095438 005__ 20200922142031.0 000095438 0247_ $$2doi$$a10.1017/S0017089518000198 000095438 0248_ $$2sideral$$a109599 000095438 037__ $$aART-2019-109599 000095438 041__ $$aeng 000095438 100__ $$aGryak, J. 000095438 245__ $$aOn the conjugacy problem in certain metabelian groups 000095438 260__ $$c2019 000095438 5060_ $$aAccess copy available to the general public$$fUnrestricted 000095438 5203_ $$aWe 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. 000095438 536__ $$9info:eu-repo/grantAgreement/ES/MINECO-FEDER/MTM2015-67781 000095438 540__ $$9info:eu-repo/semantics/openAccess$$aAll rights reserved$$uhttp://www.europeana.eu/rights/rr-f/ 000095438 590__ $$a0.548$$b2019 000095438 591__ $$aMATHEMATICS$$b245 / 324 = 0.756$$c2019$$dQ4$$eT3 000095438 592__ $$a0.427$$b2019 000095438 593__ $$aMathematics (miscellaneous)$$c2019$$dQ2 000095438 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/submittedVersion 000095438 700__ $$aKahrobaei, D. 000095438 700__ $$0(orcid)0000-0001-9147-1745$$aMartinez-Perez, C.$$uUniversidad de Zaragoza 000095438 7102_ $$12006$$2005$$aUniversidad de Zaragoza$$bDpto. Matemáticas$$cÁrea Algebra 000095438 773__ $$g61, 2 (2019), 251-269$$pGlasg. mat. j.$$tGLASGOW MATHEMATICAL JOURNAL$$x0017-0895 000095438 8564_ $$s262675$$uhttps://zaguan.unizar.es/record/95438/files/texto_completo.pdf$$yPreprint 000095438 8564_ $$s25928$$uhttps://zaguan.unizar.es/record/95438/files/texto_completo.jpg?subformat=icon$$xicon$$yPreprint 000095438 909CO $$ooai:zaguan.unizar.es:95438$$particulos$$pdriver 000095438 951__ $$a2020-09-22-12:17:32 000095438 980__ $$aARTICLE