Pages that link to "Item:Q1604340"
From MaRDI portal
The following pages link to A new algorithm for solving the word problem in braid groups (Q1604340):
Displaying 22 items.
- A simple algorithm for finding short sigma-definite representatives. (Q420741) (← links)
- A fast method for comparing braids (Q675872) (← links)
- Groups with a complemented presentation (Q678835) (← links)
- Probabilistic solutions of equations in the braid group. (Q817243) (← links)
- Algorithmic recognition of quasipositive 4-braids of algebraic length three. (Q889986) (← links)
- About the effective classification of conjugacy classes of braids (Q914192) (← links)
- Efficient solutions to the braid isotopy problem. (Q1003697) (← links)
- The use of Knuth-Bendix methods to solve the word problem in automatic groups (Q1192222) (← links)
- A new approach to the word and conjugacy problems in the braid groups (Q1273842) (← links)
- Automatic calculation of minimum crossing numbers of 3-braids. (Q1405079) (← links)
- Generating random braids (Q1758507) (← links)
- Fast algorithms for identification and comparison of braids. (Q1781292) (← links)
- Disks in trivial braid diagrams. (Q1879799) (← links)
- The Anick complex and the Hochschild cohomology of the Manturov \((2,3)\)-group (Q2191336) (← links)
- Gröbner-Shirshov bases for some braid groups. (Q2457339) (← links)
- A simple solution to the word problem for virtual braid groups (Q2629757) (← links)
- Composition Problems for Braids (Q2963911) (← links)
- CONJUGACY IN ARTIN GROUPS AND APPLICATION TO THE CLASSIFICATION OF SURFACES (Q3421577) (← links)
- (Q3545319) (← links)
- (Q3545324) (← links)
- (Q4474170) (← links)
- Polynomial braid combing (Q4629388) (← links)
