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]

Authors

Andrzej Pownuk

This author has not been identified. Look up 'Andrzej Pownuk' in Google

Luc Longpré

This author has not been identified. Look up 'Luc Longpré' in Google

Vladik Kreinovich

This author has not been identified. Look up 'Vladik Kreinovich' in Google