The computational complexity of continued fractions

Authors:
V. Strassen
Affiliations:
-
Venue:
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Year:
1981

Citing 4
Cited 3

Subresultants and Reduced Polynomial Remainder Sequences

Journal of the ACM (JACM)
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Fast computation of GCDs

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing

Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Sturm root counting using chebyshev expansion

ACM Communications in Computer Algebra
An efficient algorithm for the sign condition problem in the semi-algebraic context

GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.