Erdős-Szekeres and Testing Weak epsilon-Nets are NP-hard in 3 dimensions - and what now?
Christian KnauerDaniel WernerPublished in: CoRR (2011)
Keyphrases
- np hard
- optimal solution
- approximation algorithms
- lower bound
- special case
- remains np hard
- np hardness
- worst case
- scheduling problem
- computational complexity
- np complete
- knapsack problem
- test cases
- bayesian networks
- multiple dimensions
- data sets
- constraint satisfaction problems
- greedy heuristic
- databases
- integer programming
- real time
- randomly generated problem instances
- polynomial time approximation
- test generation
- dimensional data
- complexity analysis
- information retrieval
- decision problems
- closely related
- artificial intelligence
- theoretical analysis
- database
- linear programming
- multi dimensional
- knowledge base