The statistics of continued fractions for polynomials over a finite field
From MaRDI portal
Publication:4714675
DOI10.1090/S0002-9939-96-03394-1zbMath0869.11008OpenAlexW1488305859MaRDI QIDQ4714675
Doug Hensley, Christian Friesen
Publication date: 17 March 1997
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9939-96-03394-1
Related Items (5)
Probabilistic analyses of the plain multiple gcd algorithm ⋮ Fine costs for Euclid's algorithm on polynomials and Farey maps ⋮ Gaussian laws for the main parameters of the Euclid algorithms ⋮ D?E?K=(1000)8 ⋮ Analysis of generalized continued fraction algorithms over polynomials
Cites Work
- Rational functions with partial quotients of small degree in their continued fraction expansion
- The largest digit in the continued fraction expansion of a rational number
- The length of the continued fraction expansion for a class of rational functions in
- The Probabilistic Theory of Linear Complexity
- Applications of Number Theory to Numerical Analysis
This page was built for publication: The statistics of continued fractions for polynomials over a finite field