Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P (Q2904763)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P |
scientific article |
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
