On complexity of the word problem in bra
โ
Hessam Hamidi-Tehrani
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 350 KB
We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w| 2 g) for |w| log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w| 2 g 2 ). We also carry