Publication Date
1-2003
Abstract
We prove that no "efficient" (easy-to-check) necessary and sufficient conditions are possible for checking whether straightforward interval computations lead to the exact result.
tr02-11.pdf (93 kB)
Original Version: UTEP-CS-02-11
tr02-11a.pdf (119 kB)
Short Version: UTEP-CS-02-11a
tr02-11b.pdf (167 kB)
Revised Version: UTEP-CS-02-11b
Original Version: UTEP-CS-02-11
tr02-11a.pdf (119 kB)
Short Version: UTEP-CS-02-11a
tr02-11b.pdf (167 kB)
Revised Version: UTEP-CS-02-11b
Comments
UTEP-CS-02-11c.
Short version published in the Extended Abstracts of 2002 SIAM Workshop on Validated Computing, Toronto, Canada, May 23-25, 2002, pp. 94-96; full paper published in Reliable Computing, 2003, Vol. 9, No. 5, pp. 349-358.