Algorithmic and asymptotic properties of groups
Mark V. Sapir
Vanderbilt University, Nashville, United States
A subscription is required to access this book chapter.
Abstract
This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme properties (monsters).