Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236)
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 1060737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem |
scientific article; zbMATH DE number 1060737 |
Statements
Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (English)
0 references
15 September 1997
0 references
finitely generated semigroups
0 references
word problem
0 references
time complexity
0 references
isoperimetric functions
0 references
finitely presented semigroups
0 references
0 references
0 references
0 references
0.8595611453056335
0 references
0.8252968192100525
0 references
0.7716918587684631
0 references
