Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime
Akitoshi KawamuraNorbert Th. MüllerCarsten RösnickMartin ZieglerPublished in: CoRR (2012)
Keyphrases
- np hard
- np hardness
- worst case
- decision problems
- special case
- computational complexity
- linear programming
- approximation algorithms
- scheduling problem
- np complete
- optimal solution
- data sets
- closely related
- knapsack problem
- greedy heuristic
- greedy algorithm
- image sequences
- integer programming
- complexity analysis
- databases