scientific article
From MaRDI portal
Publication:3947116
zbMath0486.68029MaRDI QIDQ3947116
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
continued fraction expansionalgebraic complexityEuclid's algorithmcomputational complexity of polynomialsKnuth-Schoenhage algorithm
Analysis of algorithms and problem complexity (68Q25) Continued fractions (11A55) Radix representation; digital problems (11A63)
Related Items
Fast norm computation in smooth-degree abelian number fields, The computational complexity of a set of quadratic functions, On the complexity of the Lickteig-Roy subresultant algorithm, Lower bounds in algebraic computational complexity, Definability and fast quantifier elimination in algebraically closed fields
