Linear time algorithm for the conjugacy problem in the first Grigorchuk group
DOI10.1142/S0218196721500363OpenAlexW3166114698MaRDI QIDQ5002196FDOQ5002196
Authors:
Publication date: 27 July 2021
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.04028
Recommendations
- The conjugacy problem in the Grigorchuk group is polynomial time decidable.
- THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS
- Conjugacy problem in a class of \(2\)-groups
- Computational complexity and the conjugacy problem
- Time complexity of the conjugacy problem in relatively hyperbolic groups.
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Groups acting on trees (20E08) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- On Burnside's problem on periodic groups
- Conjugacy problem in an automorphism group of an infinite tree
- Quadratic equations in the Grigorchuk group.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A STRUCTURAL PROPERTY CONCERNING ABSTRACT COMMENSURABILITY OF SUBGROUPS
- The conjugacy problem in the Grigorchuk group is polynomial time decidable.
- Fast Pattern Matching in Strings
- Random subgroups and analysis of the length-based and quotient attacks
- A system of defining relations for a Grigorchuk group
- Lexicographically least circular substrings
- Conjugacy problem in a class of \(2\)-groups
- Title not available (Why is that?)
- The complexity of Grigorchuk groups with application to cryptography
- Cryptography and Coding
- THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS
Cited In (2)
This page was built for publication: Linear time algorithm for the conjugacy problem in the first Grigorchuk group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002196)
