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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.