Pages that link to "Item:Q1578891"
From MaRDI portal
The following pages link to On complexity of the word problem in braid groups and mapping class groups (Q1578891):
Displaying 6 items.
- The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. (Q408527) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- On braid words and irreflexivity (Q1315328) (← links)
- A new algorithm for solving the word problem in braid groups (Q1604340) (← links)
- Testing graph isotopy on surfaces (Q2441582) (← links)
- Two-generator subgroups of the pure braid group. (Q5961887) (← links)