Checking Monotonicity is NP-Hard Even for Cubic Polynomials

Andrzej Pownuk, Luc Longpré, Vladik Kreinovich. Checking Monotonicity is NP-Hard Even for Cubic Polynomials. Reliable Computing, 18:90-96, 2013. [doi]