A fast solution to the conjugacy problem in the 4-strand braid group
classification
🧮 math.GR
keywords
braidconjugacygroupproblemstrandalgorithmcomplexitycomputational
read the original abstract
We present an algorithm for solving the conjugacy search problem in the four strand braid group. The computational complexity is cubic with respect to the braid length.
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.