𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A continued fraction algorithm

✍ Scribed by P. Van der Cruyssen

Publisher
Springer-Verlag
Year
1981
Tongue
English
Weight
266 KB
Volume
37
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A parallel version of the continued frac
A parallel version of the continued fraction integer factoring algorithm
✍ M. C. Wunderlich; H. C. Williams πŸ“‚ Article πŸ“… 1987 πŸ› Springer US 🌐 English βš– 606 KB

A description is given of a means of implementing a parallel version of the continued fraction integer factoring algorithm (CFRAC) of Morrison and Brillhart on the Massively Parallel Processor. A case study is provided for the factorization of a 60-digit composite factor of 24o5 -1, and some further

An algorithm for shifted continued fract
An algorithm for shifted continued fraction expansions in parallel linear time
✍ Harald Niederreiter; Michael Vielhaber πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 119 KB

The linear complexity proΓΏle of a sequence of length n is readily obtained in O(n 2 ) steps by the Berlekamp-Massey algorithm (BMA). Piper demands that the linear complexity proΓΏles should be acceptable for every starting point, that is, for all shifted sequences as well. By repetition of the BMA, t