the computational complexity of continued fractions
The Knuth-Schnhage algorithm for expanding a quolynomial into a continued fraction is shown to be essentially optimal with respect to the number of multiplications/divisions used, uniformly in the inputs.
computational complexity algorithm optimality