The complexity of Dehn's algorithm for word problems in groups (Q3718927): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(85)90031-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972468537 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:01, 19 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
