Home > ENGINEERING > COMPUTER > CS_TECHREP > 653
Marcin Michalak, Silesian University of Technology Vladik Kreinovich, The University of Texas at El PasoFollow
6-2011
Technical Report: UTEP-CS-11-35
The problem of computing the range [y] of a given function f(x1, ..., xn) over given intervals [xi] -- often called the main problem of interval computations -- is, in general, NP-hard. This means that unless P = NP, it is not possible to have a feasible (= polynomial time) algorithm that always computes the desired range. Instead, interval computations algorithms compute an enclosure [Y] for the desired range. For all known feasible enclosure-computing methods -- starting with straightforward interval computations -- there exist two expressions f(x1, ..., xn) and g(x1, ..., xn) for computing the same function that lead to different enclosures. We prove that, unless P = NP, this is inevitable: it is not possible to have a feasible enclosure-computing method which is independent of the equivalent form.
DOWNLOADS
Since April 02, 2012
Computer Engineering Commons
Advanced Search
Comments
Technical Report: UTEP-CS-11-35