On the Complexity of Grammar-Based Compression over Fixed Alphabets (Q4598264)
From MaRDI portal
scientific article; zbMATH DE number 6820311
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Grammar-Based Compression over Fixed Alphabets |
scientific article; zbMATH DE number 6820311 |
Statements
19 December 2017
0 references
grammar-based compression
0 references
straight-line programs
0 references
NP-completeness
0 references
exact exponential time algorithms
0 references
On the Complexity of Grammar-Based Compression over Fixed Alphabets (English)
0 references
