STRICT LOWER AND UPPER BOUNDS ON ITERATIVE COMPUTATIONAL COMPLEXITY
STRICT LOWER AND UPPER BOUNDS ON ITERATIVE COMPUTATIONAL COMPLEXITY
In this chapter, a non-asymptotic theory of iterative computational complexity is constructed with strict lower and upper bounds. Complexity is a measure of cost. The relevant costs depend on the model under analysis. The costs can be taken as units of time, number of comparisons, size of storage, or number …