Checking Monotonicity is NP-Hard Even for Cubic Polynomials.
Andrzej PownukLuc LongpréVladik KreinovichPublished in: Reliab. Comput. (2013)
Keyphrases
- np hard
- np complete
- approximation algorithms
- scheduling problem
- minimum cost
- linear programming
- special case
- np hardness
- optimal solution
- integer programming
- remains np hard
- worst case
- lower bound
- greedy heuristic
- branch and bound algorithm
- computational complexity
- computationally hard
- computationally challenging
- closely related
- low order
- decision problems
- b spline
- consistency checking
- piecewise polynomial
- hermite transform
- constraint satisfaction problems
- real time
- d objects
- search algorithm
- approximation ratio
- bayesian networks
- website
- algebraic geometry
- series expansion
- monotonicity property
- machine learning
- real world
- databases