Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups (Q4304125): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3882632 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen / rank | |||
Normal rank | |||
Revision as of 16:42, 22 May 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
