Amanote Research
Register
Sign In
The Polynomial Complexity of Fully Materialized Coalesced Cubes
doi 10.1016/b978-012088469-8.50049-8
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2004
Authors
Yannis Sismanis
Nick Roussopoulos
Publisher
Elsevier
Related search
Sums of Cubes in Polynomial Rings
Mathematics of Computation
Computational Mathematics
Applied Mathematics
Number Theory
Algebra
Complexity of Answering Queries Using Materialized Views
On the Complexity of Polynomial Matrix Computations
On the Complexity Exponent of Polynomial System Solving
Foundations of Computational Mathematics
Mathematics
Computational Mathematics
Applied Mathematics
Analysis
Computational Theory
On the Bit Complexity of Solving Bilinear Polynomial Systems
Multiplicative Complexity of Polynomial Multiplication Over Finite Fields
Performance Evaluation of Sequential Band Orientation by Polynomial Models in Hyperspectral Cubes Collected With Uav
ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
A Fully Polynomial Time Approximation Scheme for Packing While Traveling
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
