The Computational Complexity of Continued Fractions
- 1 February 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (1) , 1-27
- https://doi.org/10.1137/0212001
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Lower bounds for polynomials with algebraic coefficientsTheoretical Computer Science, 1980
- Algebraic GeometryPublished by Springer Nature ,1977
- An elementary proof for strassen's degree boundTheoretical Computer Science, 1976
- On computing reciprocals of power seriesNumerische Mathematik, 1974
- Basic Algebraic GeometryPublished by Springer Nature ,1974
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- Schnelle Berechnung von KettenbruchentwicklungenActa Informatica, 1971
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967
- Eine Verallgemeinerung des Sturmschen WurzelzählverfahrensCommentarii Mathematici Helvetici, 1948
- Euclid's Algorithm for Large NumbersThe American Mathematical Monthly, 1938