On the complexity of the endomorphism problem for free groups. (Q2759639)
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: On the complexity of the endomorphism problem for free groups. |
scientific article; zbMATH DE number 1683602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the endomorphism problem for free groups. |
scientific article; zbMATH DE number 1683602 |
Statements
2001
0 references
endomorphism problem
0 references
free groups
0 references
endomorphisms
0 references
polynomial time algorithms
0 references
On the complexity of the endomorphism problem for free groups. (English)
0 references
0.8808833956718445
0 references
0.8772119283676147
0 references
0.865577757358551
0 references
0.8133225440979004
0 references
0.8002495169639587
0 references
