scientific article; zbMATH DE number 3877408
From MaRDI portal
Publication:3344357
Recommendations
- scientific article; zbMATH DE number 1534404
- scientific article; zbMATH DE number 66617
- Complexity of multiplication in some group algebras
- scientific article; zbMATH DE number 4042057
- Algorithmically complex residually finite groups
- Groups with orderings of arbitrary algorithmic complexity
- Algorithmic dimension of nilpotent groups
- The complexity of Dehn's algorithm for word problems in groups
- Efficiency of certain algorithms of combinatorial group theory
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344357)