Dehn's Algorithm and the Complexity of Word Problems (Q3826535)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4101159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dehn's Algorithm and the Complexity of Word Problems |
scientific article; zbMATH DE number 4101159 |
Statements
Dehn's Algorithm and the Complexity of Word Problems (English)
0 references
1988
0 references
finite Thue system
0 references
rewriting system
0 references
linear-time algorithm
0 references
0.8791553378105164
0 references
0.8184617161750793
0 references
0.814426839351654
0 references
0.8093475699424744
0 references
0.8093475699424744
0 references
