Efficient algorithms for highly compressed data: the word problem in Higman's group is in P (Q2904763)
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 Higman's group is in P |
scientific article; zbMATH DE number 6070904
| 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 6070904 |
Statements
23 August 2012
0 references
algorithmic group theory
0 references
data structures
0 references
compression
0 references
word problem
0 references
math.GR
0 references
Efficient algorithms for highly compressed data: the word problem in Higman's group is in P (English)
0 references
0.997749090194702
0 references
0.9411353468894958
0 references
0.8145348429679871
0 references
0.8087276220321655
0 references
0.799797773361206
0 references
