Algorithmic and asymptotic properties of groups.
From MaRDI portal
Publication:5489374
Recommendations
Cited in
(17)- Generalized algorithm for modeling periodic groups.
- Conjugacy problem in groups with quadratic Dehn function
- A Higman embedding preserving asphericity.
- Algorithmically finite groups.
- Finding non-trivial elements and splittings in groups.
- The isoperimetric spectrum of finitely presented groups
- Asymptotic invariants, complexity of groups and related problems.
- Polynomially-bounded Dehn functions of groups
- The Higman operations and embeddings of recursive groups
- On torsion in finitely presented groups.
- A survey of recent results in groups and orderings: word problems, embeddings and amalgamations
- LENGTH AND AREA FUNCTIONS ON GROUPS AND QUASI-ISOMETRIC HIGMAN EMBEDDINGS
- Turing degrees and the word and conjugacy problems for finitely presented groups.
- The conjugacy problem for groups, and Higman embeddings
- The conjugacy problem and Higman embeddings
- Magnus embedding and algorithmic properties of groups \(F/N^{(d)}\)
- Group Embeddings with Algorithmic Properties
This page was built for publication: Algorithmic and asymptotic properties of groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5489374)