The complexity of Dehn's algorithm for word problems in groups (Q3718927): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 13:28, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of Dehn's algorithm for word problems in groups |
scientific article |
Statements
The complexity of Dehn's algorithm for word problems in groups (English)
0 references
1985
0 references
Dehn's algorithm
0 references
Turing machine
0 references
word problem
0 references
DA-group
0 references
