Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups (Q4304125): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/malq.19930390117 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126258842 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/MALQ.19930390117 / rank | |||
Normal rank | |||
Latest revision as of 17:39, 29 December 2024
scientific article; zbMATH DE number 635986
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups |
scientific article; zbMATH DE number 635986 |
Statements
Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups (English)
0 references
24 November 1994
0 references
word problems for groups
0 references
pseudo-natural algorithm
0 references
complexity
0 references
halting problem
0 references
modular machines
0 references
Turing machines
0 references
