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.
No takes yet. Share an insight, caveat, or question.
Volker Strassen (1983) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context:
More from SIAM Journal on Computing