Publication:3947116
From MaRDI portal
zbMath0486.68029MaRDI QIDQ3947116
Publication date: 1981
continued fraction expansion; algebraic complexity; Euclid's algorithm; computational complexity of polynomials; Knuth-Schoenhage algorithm
68Q25: Analysis of algorithms and problem complexity
11A55: Continued fractions
11A63: Radix representation; digital problems
Related Items
Definability and fast quantifier elimination in algebraically closed fields, Lower bounds in algebraic computational complexity, The computational complexity of a set of quadratic functions, On the complexity of the Lickteig-Roy subresultant algorithm