Open Research Newcastle
Browse

Some geodesic problems in groups

Download (248.68 kB)
journal contribution
posted on 2025-05-09, 23:42 authored by Murray Elder, Andrew Rechnitzer
We consider several algorithmic problems concerning geodesics in finitely generated groups. We show that the three geodesic problems considered by Miasnikov et al. are polynomial-time reducible to each other. We study two new geodesic problems which arise in a previous paper of the authors and Fusy.

History

Journal title

Groups Complexity Cryptology

Volume

2

Issue

2

Pagination

223-229

Publisher

Walter de Gruyter

Language

  • en, English

College/Research Centre

Faculty of Science and Information Technology

School

School of Mathematical and Physical Sciences

Usage metrics

    Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC