Polynomial asymptotic complexity of multiple-objective OLAP data cube compression (Q3143207)
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: Polynomial asymptotic complexity of multiple-objective OLAP data cube compression |
scientific article; zbMATH DE number 6110914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial asymptotic complexity of multiple-objective OLAP data cube compression |
scientific article; zbMATH DE number 6110914 |
Statements
Polynomial Asymptotic Complexity of Multiple-Objective OLAP Data Cube Compression (English)
0 references
28 November 2012
0 references
0.7148339152336121
0 references
0.7017486095428467
0 references
0.7016190886497498
0 references
0.6807796955108643
0 references
