On the complexity of grammar-based compression over fixed alphabets (Q4598264)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of grammar-based compression over fixed alphabets |
scientific article; zbMATH DE number 6820311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9028430581092834
0 references
0.8149738311767578
0 references
0.7926161885261536
0 references
0.7811205983161926
0 references
