The Computational Complexity of Continued Fractions


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.

DOI: 10.1145/800206.806371

Extracted Key Phrases


Citations per Year

52 Citations

Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

Cite this paper

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