DOIAbstract
AbstractWe give a new algorithm to solve with cubic complexity the word problem in the braid group Bn. This allows us to give an effective answer to the conjugacy problem in B4,B5
AbstractWe give a new algorithm to solve with cubic complexity the word problem in the braid group Bn. This allows us to give an effective answer to the conjugacy problem in B4,B5
In this note we solve the twisted conjugacy problem for braid groups, i.e., we propose an algorithm ...
AbstractRecently, the generalized conjugacy problem(GCP) in braid groups was introduced as a candida...
In this paper, we present Artin’s original solution to the word\ud problem. We begin with a quick re...
AbstractWe give a new algorithm to solve with cubic complexity the word problem in the braid group B...
AbstractA new presentation of then-string braid groupBnis studied. Using it, a new solution to the w...
We present an algorithm for solving the conjugacy search problem in the fourstrand braid group. The ...
AbstractWe present a new algorithm to solve the conjugacy problem in Artin braid groups, which is fa...
International audienceWe present an algorithm for solving the conjugacy search problem in the four s...
. We exhibit a new quadratic time near-constant space algorithm for solving the word problem in the ...
The aim of this thesis is to develop new algorithms for the braid groups. An important problem in th...
AbstractWe show how term rewriting can be applied to the conjugacy problem for finitely presented gr...
AbstractAlgorithmic solutions to the conjugacy problem in the braid groups Bn,n =2, 3, 4, … were giv...
Abstract. We investigate two “categorified ” braid conjugacy class invariants, one com-ing from Khov...
Abstract. We implement various computations in the braid groups via practically efficient and theore...
In this note we solve the twisted conjugacy problem for braid groups, i.e., we propose an algorithm ...
In this note we solve the twisted conjugacy problem for braid groups, i.e., we propose an algorithm ...
AbstractRecently, the generalized conjugacy problem(GCP) in braid groups was introduced as a candida...
In this paper, we present Artin’s original solution to the word\ud problem. We begin with a quick re...
AbstractWe give a new algorithm to solve with cubic complexity the word problem in the braid group B...
AbstractA new presentation of then-string braid groupBnis studied. Using it, a new solution to the w...
We present an algorithm for solving the conjugacy search problem in the fourstrand braid group. The ...
AbstractWe present a new algorithm to solve the conjugacy problem in Artin braid groups, which is fa...
International audienceWe present an algorithm for solving the conjugacy search problem in the four s...
. We exhibit a new quadratic time near-constant space algorithm for solving the word problem in the ...
The aim of this thesis is to develop new algorithms for the braid groups. An important problem in th...
AbstractWe show how term rewriting can be applied to the conjugacy problem for finitely presented gr...
AbstractAlgorithmic solutions to the conjugacy problem in the braid groups Bn,n =2, 3, 4, … were giv...
Abstract. We investigate two “categorified ” braid conjugacy class invariants, one com-ing from Khov...
Abstract. We implement various computations in the braid groups via practically efficient and theore...
In this note we solve the twisted conjugacy problem for braid groups, i.e., we propose an algorithm ...
In this note we solve the twisted conjugacy problem for braid groups, i.e., we propose an algorithm ...
AbstractRecently, the generalized conjugacy problem(GCP) in braid groups was introduced as a candida...
In this paper, we present Artin’s original solution to the word\ud problem. We begin with a quick re...
Add to ORKG