Packing cubes into a cube is NP-complete in the strong sense.
Yiping LuDanny Z. ChenJianzhong ChaPublished in: J. Comb. Optim. (2015)
Keyphrases
- np complete
- data cube
- randomly generated
- satisfiability problem
- aggregate functions
- polynomial time complexity
- multi dimensional
- np complete problems
- computational complexity
- data complexity
- packing problem
- constraint satisfaction problems
- conjunctive queries
- phase transition
- olap operations
- aggregate queries
- np hard
- data warehouse
- pspace complete
- expressive power
- space time
- data sources
- query language
- online analytical processing
- search algorithm
- conp complete
- database systems
- information systems