Abstract
We present an algorithm for solving the conjugacy search problem in the fourstrand braid group. The computational complexity is cubic with respect to the braid length.
Cite
CITATION STYLE
APA
Calvez, M., & Wiest, B. (2014). A fast solution to the conjugacy problem in the four-strand braid group. Journal of Group Theory, 17(5), 757–780. https://doi.org/10.1515/jgth-2014-0020
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free