Some geodesic problems in groups
classification
🧮 math.GR
keywords
problemsgeodesicarxivgroupsalgorithmicariseauthorsconcerning
read the original abstract
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] .
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.