Affiliation:
1. Applied Biomathematics, Setauket, NY
2. University of Texas at El Paso, El Paso, TX
Abstract
When we have only interval ranges [
x
i
,
x
i
] of sample values
x
1
,…,
x
n
,
what is the interval [
V, V
] of possible values for the variance
V
of these values? We prove that the problem of computing the upper bound
V
is NP-hard. We provide a feasible (quadratic time) algorithm for computing the lower bound
V
on the variance of interval data. We also provide a feasible algorithm that computes
V
under reasonable easily verifiable conditions.
Publisher
Association for Computing Machinery (ACM)
Cited by
70 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献