Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P (Q2254512)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
