Dynamical analysis of α-Euclidean algorithms

From MaRDI portal





The authors are interested in the complexity of Euclidean division algorithms, where the ratio of the remainder by the divisor must belong to \([\alpha-1,\alpha)\) for some \(\alpha\in [0,1]\). For arbitrary \(\alpha\)'s the dynamical analysis is complicated: the involved dynamical systems are not necessarily Markovian. The tools are Dirichlet series, (Ruelle) transfer operators and Tauberian theorems. Note that reference [24][\textit{B. Vallée}, Theor. Comput. Sci. 297, 447-486 (2003; Zbl 1044.68164)] has now appeared.











This page was built for publication: Dynamical analysis of α-Euclidean algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4799529)