Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. (Q1401920)
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 1967115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. |
scientific article; zbMATH DE number 1967115 |
Statements
Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. (English)
0 references
19 August 2003
0 references
Parallel complexity
0 references
NC algorithms
0 references
SC\(^k\)-completeness
0 references
Data compression
0 references
Dictionary algorithms
0 references
0.8662907
0 references
0 references
0.8460752
0 references
0.83584595
0 references
0.83542055
0 references
0.83478034
0 references
0.8331514
0 references
0 references
