2009/07/31 by Murray Elder, Andrew Rechnitzer
Mathematics · #math.GR #msc:20F65
paper · pdf · doi:10.1515/gcc.2010.014
6 pages
arxiv created 2010/09/07 · arxiv updated 2014/01/28
We consider several algorithmic problems concerning geodesics in finitely generated groups. We show that the three geodesic problems considered by Miasnikov et al [arXiv:0807.1032] are polynomial-time reducible to each other. We study two new geodesic problems which arise in a previous paper of the authors and Fusy [arXiv:0902.0202] .