Publication Date
3-2002
Abstract
We provide a feasible (quadratic time) algorithm for computing the lower bound on the sample variance V of interval data. The problem of computing the upper bound on V is, in general, NP-hard. We provide a feasible algorithm that computes the upper bound on V for many reasonable situations.
Comments
UTEP-CS-02-13.
Short version published in the Extended Abstracts of 2002 SIAM Workshop on Validated Computing, Toronto, Canada, May 23-25, 2002, pp. 67-69.