Algorithmic and asymptotic properties of groups
classification
🧮 math.GR
math.GT
keywords
groupspropertiesalgorithmicasymptoticcomplexityconstructionsdehndiscuss
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.