EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (Q4904514): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0218196712400085 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2115760473 / rank | |||
Normal rank | |||
Latest revision as of 08:51, 30 July 2024
scientific article; zbMATH DE number 6132712
| 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; 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
