On the complexity and approximability of bounded access Lempel Ziv coding (Q7034838)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7977179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity and approximability of bounded access Lempel Ziv coding |
scientific article; zbMATH DE number 7977179 |
Statements
On the complexity and approximability of bounded access Lempel Ziv coding (English)
0 references
31 January 2025
0 references
Lempel Ziv parsing
0 references
bounded access encoding
0 references
NP-hardness
0 references
approximation
0 references
