Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P (Q2254512)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P |
scientific article |
Statements
Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P (English)
0 references
5 February 2015
0 references
data structures
0 references
compression
0 references
algorithmic group theory
0 references
word problem
0 references
0 references
0 references
0.9411353468894958
0 references
0.9367011785507202
0 references
0.803291380405426
0 references
0.7934734225273132
0 references
0.790500283241272
0 references
