On the complexity of the smallest grammar problem over fixed alphabets (Q2035481)
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 the smallest grammar problem over fixed alphabets |
scientific article; zbMATH DE number 7363126
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the smallest grammar problem over fixed alphabets |
scientific article; zbMATH DE number 7363126 |
Statements
On the complexity of the smallest grammar problem over fixed alphabets (English)
0 references
24 June 2021
0 references
grammar-based compression
0 references
smallest grammar problem
0 references
straight-line programs
0 references
NP-completeness
0 references
exact exponential-time algorithms
0 references
0 references
0.9028430581092834
0 references
0.8496401309967041
0 references
0.825668215751648
0 references
0.8074240684509277
0 references
0.8059394359588623
0 references
