@article{Cavallo_Kahrobaei_2014, title={A polynomial time algorithm for the conjugacy problem in Zn o Z}, volume={1}, url={https://revistes.iec.cat/index.php/reports/article/view/124908}, abstractNote={In this paper we introduce a polynomial time algorithm that solves both the conjugacy decision and search problems in free abelian-by-innite cyclic groups where the input is elements in normal form. We do this by adapting the work of Bogopolski, Martino, Maslakova, and Ventura in [1] and Bogopolski, Martino, and Ventura in [2], to free abelian-by-innite cyclic groups, and in certain cases apply a polynomial time algorithm for the orbit problem over Zn by Kannan and Lipton [7].<br /><br />Keywords: Conjugacy problem, semidirect product. MSC (2010): Primary 20F10, Secondary 20E06.}, number={1}, journal={Reports@SCM}, author={Cavallo, Bren and Kahrobaei, Delaram}, year={2014}, month={Oct.}, pages={55–60} }