Efficient algorithms for highly compressed data: the word problem in Higman's group is in P. (Q4904514)
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 6132712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for highly compressed data: the word problem in Higman's group is in P. |
scientific article; zbMATH DE number 6132712 |
Statements
EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (English)
0 references
30 January 2013
0 references
Baumslag group
0 references
Higman group
0 references
data structures
0 references
compression
0 references
algorithmic group theory
0 references
word problem
0 references
0 references
0 references
0.997749090194702
0 references
0.9367011785507202
0 references
0.8126555681228638
0 references
0.8093823194503784
0 references
0.7958875894546509
0 references
