Lempel-Ziv Factorization May Be Harder Than Computing All Runs (Q2955025)
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: Lempel-Ziv Factorization May Be Harder Than Computing All Runs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lempel-Ziv Factorization May Be Harder Than Computing All Runs |
scientific article |
Statements
24 January 2017
0 references
Lempel-Ziv factorization
0 references
runs
0 references
repetitions
0 references
decision tree
0 references
lower bounds
0 references
Lempel-Ziv Factorization May Be Harder Than Computing All Runs (English)
0 references
