𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a problem of day on nonelementary amenable groups in the class of finitely defined groups

✍ Scribed by R. I. Grigorchuk


Publisher
SP MAIK Nauka/Interperiodica
Year
1996
Tongue
English
Weight
199 KB
Volume
60
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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