THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS
From MaRDI portal
Publication:5483462
DOI10.1142/S0218196706002986zbMath1141.20028OpenAlexW1978029823MaRDI QIDQ5483462
Derek F. Holt, David B. A. Epstein
Publication date: 14 August 2006
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196706002986
Symbolic computation and algebraic computation (68W30) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Hyperbolic groups and nonpositively curved groups (20F67) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Polynomial time conjugacy in wreath products and free solvable groups ⋮ The Development of the Theory of Automatic Groups ⋮ Notions of hyperbolicity in monoids. ⋮ Permute and conjugate: the conjugacy problem in relatively hyperbolic groups ⋮ Time complexity of the conjugacy problem in relatively hyperbolic groups ⋮ Decision problems and profinite completions of groups. ⋮ Exponentially generic subsets of groups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Knapsack in hyperbolic groups ⋮ Solving the Conjugacy Decision Problem via Machine Learning ⋮ Complexity of word problems for HNN-extensions ⋮ Complexity of word problems for HNN-extensions ⋮ Finite generating sets of relatively hyperbolic groups and applications to geodesic languages ⋮ The conjugacy problem in subgroups of right-angled Artin groups ⋮ Linear time algorithm for the conjugacy problem in the first Grigorchuk group ⋮ THE CONJUGACY PROBLEM IN HYPERBOLIC GROUPS FOR FINITE LISTS OF GROUP ELEMENTS
Cites Work
