Highly Influenced

6 Excerpts

- Published 1981 in SIAM J. Comput.

The Knuth-Schönhage 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.

@inproceedings{Strassen1981TheCC,
title={The Computational Complexity of Continued Fractions},
author={Volker Strassen},
booktitle={SIAM J. Comput.},
year={1981}
}