Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series (Q1108264)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series |
scientific article; zbMATH DE number 4066860
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series |
scientific article; zbMATH DE number 4066860 |
Statements
Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series (English)
0 references
1987
0 references
See the review in Zbl 0638.03038.
0 references
enumerable group
0 references
Turing degree
0 references
lower central series
0 references
0.87776333
0 references
0.85959136
0 references
0.85845786
0 references
