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 the normal view instead:
scientific article; zbMATH DE number 6677424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lempel-Ziv factorization may be harder than computing all runs |
scientific article; zbMATH DE number 6677424 |
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
0.860283613204956
0 references
0.8448047637939453
0 references
0.8278541564941406
0 references
0.8146793246269226
0 references
0.8074650168418884
0 references
