The computational complexity of problems to compute intervals wrappers for random variables uniform, Exponential and Pareto

When working with floating point numbers the result is only an approximation of a real value and errors generated by rounding or by instability of the algorithms can lead to incorrect results. We can´t affirm the accuracy of the estimated answer without the contribution of an error analysis. Interval techniques compute an interval range, with the assurance the answer belongs to this range. Using intervals for the representation of real numbers, it is possible to control the error propagation of rounding or truncation, between others, in numerical computational procedures. Therefore, intervals results carry with them the security of their quality. The goal is to analyze the computational complexity of the problems of computing enclosures intervals for random variables Uniform, Exponential and Pareto, showing that the intervals algorithms have linear complexity, which together with the security that interval mathematics provides, makes the use of intervals even more justified.